The critical complexity of all (monotone) Boolean functions and monotone graph properties
Information and Control
Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
The complexity of Boolean functions
The complexity of Boolean functions
Lower bounds on the complexity of graph properties
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Concrete mathematics: a foundation for computer science
Concrete mathematics: a foundation for computer science
SIAM Journal on Computing
On the degree of polynomials that approximate symmetric Boolean functions (preliminary version)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On read-once threshold formulae and their randomized decision tree complexity
Theoretical Computer Science - Special issue on structure in complexity theory
On the degree of Boolean functions as real polynomials
Computational Complexity - Special issue on circuit complexity
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Sensitivity vs. block sensitivity (an average-case study)
Information Processing Letters
The average sensitivity of bounded-depth circuits
Information Processing Letters
The quantum query complexity of approximating the median and related statistics
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A note on quantum black-box complexity of almost all Boolean functions
Information Processing Letters
Complexity limitations on Quantum computation
Journal of Computer and System Sciences
Information Processing Letters
Quantum computation and quantum information
Quantum computation and quantum information
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity
COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
Quantum Lower Bounds by Polynomials
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Quantum Oracle Interrogation: Getting All Information for Almost Half the Price
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Bounds for Small-Error and Zero-Error Quantum Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
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
Introduction to Recent Quantum Algorithms
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Quantum time-space tradeoffs for sorting
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Two applications of information complexity
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Quantum zero-error algorithms cannot be composed
Information Processing Letters
ACM SIGACT News
Lower bounds for local search by quantum arguments
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Combinatorics, Probability and Computing
A lower bound on the quantum query complexity of read-once functions
Journal of Computer and System Sciences
The complexity of the certification of properties of stable marriage
Information Processing Letters
Every decision tree has an in.uential variable
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
New upper and lower bounds for randomized and quantum local search
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
On the power of Ambainis lower bounds
Theoretical Computer Science
A note on the size of minimal covers
Information Processing Letters
Negative weights make adversaries stronger
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Minimization of decision trees is hard to approximate
Journal of Computer and System Sciences
Quantum certificate complexity
Journal of Computer and System Sciences
Algebrization: a new barrier in complexity theory
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Evolving blackbox quantum algorithms using genetic programming
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Local approximation of pagerank and reverse pagerank
Proceedings of the 17th ACM conference on Information and knowledge management
Algebrization: A New Barrier in Complexity Theory
ACM Transactions on Computation Theory (TOCT)
Quantum Queries on Permutations with a Promise
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
On the Tightness of the Buhrman-Cleve-Wigderson Simulation
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
The complexity of the certification of properties of Stable Marriage
Information Processing Letters
On the parity complexity measures of Boolean functions
Theoretical Computer Science
High precision quantum query algorithm for computing AND-based boolean functions
Proceedings of the 7th ACM international conference on Computing frontiers
Optimal direct sum results for deterministic and randomized decision tree complexity
Information Processing Letters
On directional vs. undirectional randomized decision tree complexity for read-once formulas
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
ACM Transactions on Computation Theory (TOCT)
Composition theorems in communication complexity
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Quantum query algorithms for conjunctions
UC'10 Proceedings of the 9th international conference on Unconventional computation
New developments in quantum algorithms
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Nonadaptive quantum query complexity
Information Processing Letters
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
TQC'10 Proceedings of the 5th conference on Theory of quantum computation, communication, and cryptography
Sensitivity versus block sensitivity of Boolean functions
Information Processing Letters
On the competitive ratio of evaluating priced functions
Journal of the ACM (JACM)
An improved lower bound on the sensitivity complexity of graph properties
Theoretical Computer Science
Unbounded-error quantum query complexity
Theoretical Computer Science
On quantum-classical equivalence for composed communication problems
Quantum Information & Computation
Quantum communication complexity of block-composed functions
Quantum Information & Computation
Exact quantum lower bound for grover's problem
Quantum Information & Computation
A note on quantum algorithms and the minimal degree of ε-error polynomials for symmetric functions
Quantum Information & Computation
Minterm-transitive functions with asymptotically smallest block sensitivity
Information Processing Letters
Local computation of PageRank: the ranking side
Proceedings of the 20th ACM international conference on Information and knowledge management
Memory-restricted black-box complexity of OneMax
Information Processing Letters
Testing Fourier Dimensionality and Sparsity
SIAM Journal on Computing
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
On the degree of univariate polynomials over the integers
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
All quantum adversary methods are equivalent
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On the average sensitivity of the weighted sum function
Information Processing Letters
Promised and distributed quantum search
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Block sensitivity of weakly symmetric functions
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Boolean functions with a low polynomial degree and quantum query algorithms
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Reflections for quantum query algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Bounding the randomized decision tree complexity of read-once Boolean functions
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Exponential lower bound for bounded depth circuits with few threshold gates
Information Processing Letters
Robust polynomials and quantum algorithms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
On approximation algorithms for data mining applications
Efficient Approximation and Online Algorithms
Span programs for functions with constant-sized 1-certificates: extended abstract
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Impossibility of succinct quantum proofs for collision-freeness
Quantum Information & Computation
SIAM Journal on Computing
On the possibilities and limitations of pseudodeterministic algorithms
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Evasiveness through a circuit lens
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Adversary lower bound for the k-sum problem
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
On the sensitivity complexity of bipartite graph properties
Theoretical Computer Science
On the complexity of trial and error
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Superlinear advantage for exact quantum algorithms
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
ACM Transactions on Computation Theory (TOCT) - Special issue on innovations in theoretical computer science 2012
An improved lower bound for the randomized decision tree complexity of recursive majority,
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
On the structure of boolean functions with small spectral norm
Proceedings of the 5th conference on Innovations in theoretical computer science
Quantum decision tree classifier
Quantum Information Processing
| Hi-index | 0.01 |
We discuss several complexity measures for Boolean functions: certificate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. We survey the relations and biggest gaps known between these measures, and show how they give bounds for the decision tree complexity of Boolean functions on deterministic, randomized, and quantum computers.