Quantum lower bounds by polynomials
Journal of the ACM (JACM)
Quantum lower bound for the collision problem
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Complexity measures and decision tree complexity: a survey
Theoretical Computer Science - Complexity and logic
On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
One complexity theorist's view of quantum computing
Theoretical Computer Science - Algorithms,automata, complexity and games
Information and Computation
Bounds for Small-Error and Zero-Error Quantum Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Sensitivity, block sensitivity, and l-block sensitivity of boolean functions
Information and Computation
Complexity of some arithmetic problems for binary polynomials
Computational Complexity
A lower bound on the quantum query complexity of read-once functions
Journal of Computer and System Sciences
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Polynomial degree vs. quantum query complexity
Journal of Computer and System Sciences - Special issue on FOCS 2003
LWPP and WPP are not uniformly gap-definable
Journal of Computer and System Sciences
Bounds on the Fourier coefficients of the weighted sum function
Information Processing Letters
The quantum query complexity of the abelian hidden subgroup problem
Theoretical Computer Science
Extremal properties of polynomial threshold functions
Journal of Computer and System Sciences
Improved Separations between Nondeterministic and Randomized Multiparty Communication
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Variable Influences in Conjunctive Normal Forms
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Improved Separations between Nondeterministic and Randomized Multiparty Communication
ACM Transactions on Computation Theory (TOCT)
Complexity Lower Bounds using Linear Algebra
Foundations and Trends® in Theoretical Computer Science
Circuit complexity of testing square-free numbers
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the average sensitivity of testing square-free numbers
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation
A strong direct product theorem for disjointness
Proceedings of the forty-second ACM symposium on Theory of computing
Hardness amplification in proof complexity
Proceedings of the forty-second ACM symposium on Theory of computing
ACM SIGACT News
Composition theorems in communication complexity
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
An improved lower bound on the sensitivity complexity of graph properties
Theoretical Computer Science
Representing boolean functions using polynomials: more can offer less
ISNN'11 Proceedings of the 8th international conference on Advances in neural networks - Volume Part III
Unbounded-error quantum query complexity
Theoretical Computer Science
On quantum-classical equivalence for composed communication problems
Quantum Information & Computation
Quantum interpolation of polynomilas
Quantum Information & Computation
A note on quantum algorithms and the minimal degree of ε-error polynomials for symmetric functions
Quantum Information & Computation
Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
Journal of Computer and System Sciences
A quantum lower bound for the query complexity of simon's problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Block sensitivity of weakly symmetric functions
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Robust polynomials and quantum algorithms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
The multiparty communication complexity of set disjointness
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Making polynomials robust to noise
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Evasiveness through a circuit lens
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Properties and applications of boolean function composition
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Superlinear advantage for exact quantum algorithms
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Communication lower bounds using directional derivatives
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Dual lower bounds for approximate degree and markov-bernstein inequalities
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Gems in decision tree complexity revisited
ACM SIGACT News
Improved Approximation of Linear Threshold Functions
Computational Complexity
| Hi-index | 0.00 |