Result 1 to 20 from 37 total
Near-optimal expanding generator sets for solvable permutation groups. (English)
Rovan, Branislav (ed.) et al., Mathematical foundations of computer science 2012. 37th international symposium, MFCS 2012, Bratislava, Slovakia, August 27‒31, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32588-5/pbk). Lecture Notes in Computer Science 7464, 112-123 (2012).
1
Erdős-Rényi sequences and deterministic construction of expanding Cayley graphs. (English)
Fernández-Baca, David (ed.), LATIN 2012: Theoretical informatics. 10th Latin American symposium, Arequipa, Peru, April 16‒20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29343-6/pbk). Lecture Notes in Computer Science 7256, 37-48 (2012).
2
Erd{\H}os-Rényi sequences and deterministic construction of expanding Cayley graphs. (English)
Electron. Colloq. Comput. Complex. 18, 81 (2011).
3
New results on noncommutative and commutative polynomial identity testing. (English)
Comput. Complexity 19, No. 4, 521-558 (2010).
4
Isomorphism and canonization of tournaments and hypertournaments. (English)
J. Comput. Syst. Sci. 76, No. 7, 509-523 (2010).
5
Prediction intervals for time series: a modified sieve bootstrap approach. (English)
Commun. Stat., Simulation Comput. 39, No. 3, 517-538 (2010).
6
The ideal membership problem and polynomial identity testing. (English)
Inf. Comput. 208, No. 4, 351-363 (2010).
7
Prediction intervals for time series: A modified sieve bootstrap approach (English)
Communications in Statistics - Simulation and Computation 39, No. 3, 517-538 (2010).
8
Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields (English)
FOCS, 695-704 (2010).
9
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in (English)
STOC, 649-658 (2010).
10
Quantum query complexity of multilinear identity testing. (English)
Albers, Susanne (ed.) et al., STACS 2009. 26th international symposium on theoretical aspects of computer science, Freiburg, Germany, February 26‒28, 2009. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-09-5). LIPICS ‒ Leibniz International Proceedings in Informatics 3, 87-98, electronic only (2009).
11
Quantum query complexity of multilinear identity testing (English)
STACS, 87-98 (2009).
12
Webometric analysis of central universities in India: A study (English)
ICITST, 1-9 (2009).
13
Quantum query complexity of multilinear identity testing. (English)
Electron. Colloq. Comput. Complex. 15, No. 086 (2008).
14
Derandomizing the isolation lemma and lower bounds for noncommutative circuit size. (English)
Electron. Colloq. Comput. Complex. 15, No. 049 (2008).
15
New results on noncommutative and commutative polynomial identity testing. (English)
Electron. Colloq. Comput. Complex. 15, No. 025 (2008).
16
Quantum query complexity of multilinear identity testing. (English)
Comput. Res. Repos. 2008, Article No. 0807.1412 (2008).
17
Derandomizing the isolation lemma and lower bounds for circuit size. (English)
Comput. Res. Repos. 2008, Article No. 0804.0957 (2008).
18
New results on noncommutative and commutative polynomial identity testing. (English)
Comput. Res. Repos. 2008, Article No. 0801.0514 (2008).
19
Derandomizing the isolation lemma and lower bounds for circuit size. (English)
Goel, Ashish (ed.) et al., Approximation, randomization and combinatorial optimization. Algorithms and techniques. 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008, Boston, MA, USA, August 25‒27, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85362-6/pbk). Lecture Notes in Computer Science 5171, 276-289 (2008).
20
Result 1 to 20 from 37 total
Start
Contact
Print
General Help
