Computational Work and Time on Finite Machines
Journal of the ACM (JACM)
On isomorphisms and density of NP and other complete sets
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
On simultaneous resource bounds
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
The polynomial-time hierarchy and sparse oracles
Journal of the ACM (JACM)
On polynomial time bounded truth-table reducibility of NP sets to sparse sets
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
ACM SIGACT News
Journal of the ACM (JACM)
The random oracle hypothesis is false
Journal of Computer and System Sciences
On reductions of NP sets to sparse sets
Journal of Computer and System Sciences
Semi-membership algorithms: some recent advances
ACM SIGACT News
The size of a revised knowledge base
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Algorithmic complexity in coding theory and the minimum distance problem
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Hardness and hierarchy theorems for probabilistic quasi-polynomial time
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Monotonic reductions, representative equivalence, and compilation of intractable problems
Journal of the ACM (JACM)
Knowledge compilation = query rewriting + view synthesis
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the expressive power of planning formalisms
Logic-based artificial intelligence
Analytic sets in descriptive set theory and NP sets in complexity theory
Fundamenta Informaticae
Cosmological lower bound on the circuit complexity of a small problem in logic
Journal of the ACM (JACM)
ACM SIGACT News
Computational complexity of neural networks: a survey
Nordic Journal of Computing
Emergence of a Super-Turing Computational Potential in Artificial Living Systems
ECAL '01 Proceedings of the 6th European Conference on Advances in Artificial Life
Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Competing Provers Yield Improved Karp-Lipton Collapse Results
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Algebraic Properties for P-Selectivity
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Beyond the Turing Limit: Evolving Interactive Systems
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Relativistic Computers and Non-uniform Complexity Theory
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Preprocessing of intractable problems
Information and Computation
The size of MDP factored policies
Eighteenth national conference on Artificial intelligence
Six Hypotheses in Search of a Theorem
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Separating NP-Completeness Notions Under Strong Hypotheses
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Sparse sets in NP-P: Exptime versus nexptime
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
P-immune sets with holes lack self-reducibility properties
Theoretical Computer Science
Query complexity of membership comparable sets
Theoretical Computer Science
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes
Theoretical Computer Science
Upper bounds on ATSP neighborhood size
Discrete Applied Mathematics
Some connections between bounded query classes and non-uniform complexity
Information and Computation
Average-case intractability vs. worst-case intractability
Information and Computation
Lower bounds and the hardness of counting properties
Theoretical Computer Science
On the reducibility of sets inside NP to sets with low information content
Journal of Computer and System Sciences
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
Computational Complexity
Beyond NP: the work and legacy of Larry Stockmeyer
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Maximum-likelihood decoding of Reed-Solomon codes is NP-hard
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Competing provers yield improved Karp-Lipton collapse results
Information and Computation
Open questions in the theory of semifeasible computation
ACM SIGACT News
A note on the circuit complexity of PP
Theoretical Computer Science
Computational depth: concept and applications
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Compilability of propositional abduction
ACM Transactions on Computational Logic (TOCL)
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy
Theoretical Computer Science
The boolean hierarchy of NP-partitions
Information and Computation
Uniform Circuits, & Boolean Proof Nets
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Limitations of Hardness vs. Randomness under Uniform Reductions
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
A Tight Karp-Lipton Collapse Result in Bounded Arithmetic
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Nondeterministic Instance Complexity and Proof Systems with Advice
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Separating NE from Some Nonuniform Nondeterministic Complexity Classes
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Space efficiency of propositional knowledge representation formalisms
Journal of Artificial Intelligence Research
On polynomial sized MDP succinct policies
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
The comparative linguistics of knowledge representation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Theoretical Computer Science
A perspective on knowledge compilation
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Competing provers yield improved Karp-Lipton collapse results
Information and Computation
On proving circuit lower bounds against the polynomial-time hierarchy: positive and negative results
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Lower bounds for non-interactive zero-knowledge
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Sparse sets, approximable sets, and parallel queries to NP
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Super-polynomial versus half-exponential circuit size in the exponential hierarchy
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
The 1-versus-2 queries problem revisited
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A tight Karp-Lipton collapse result in bounded arithmetic
ACM Transactions on Computational Logic (TOCL)
Improving exhaustive search implies superpolynomial lower bounds
Proceedings of the forty-second ACM symposium on Theory of computing
On the role of distances in defining voting rules
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Proof systems that take advice
Information and Computation
Two-way automata versus logarithmic space
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Exact learning algorithms, betting games, and circuit lower bounds
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Transition function complexity of finite automata
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Guest column: a casual tour around a circuit complexity bound
ACM SIGACT News
Separating NE from some nonuniform nondeterministic complexity classes
Journal of Combinatorial Optimization
Foundations of instance level updates in expressive description logics
Artificial Intelligence
Oblivious symmetric alternation
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Linear advice for randomized logarithmic space
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
P-Selectivity, immunity, and the power of one bit
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
On evolutionary lineages of membrane systems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Different approaches to proof systems
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Random access to advice strings and collapsing results
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
NE is not NP turing reducible to nonexponentially dense NP sets
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Survey: The consequences of eliminating NP solutions
Computer Science Review
Analytic sets in Descriptive Set Theory and NP sets in Complexity Theory
Fundamenta Informaticae
Algorithms and limits for compact plan representations
Journal of Artificial Intelligence Research
Instance compression for the polynomial hierarchy and beyond
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Propositional Update Operators Based on Formula/Literal Dependence
ACM Transactions on Computational Logic (TOCL)
Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds
ACM Transactions on Computation Theory (TOCT)
A refined view of causal graphs and component sizes: SP-closed graph classes and beyond
Journal of Artificial Intelligence Research
| Hi-index | 0.01 |
It is well known that every set in P has small circuits [13]. Adleman [1] has recently proved the stronger result that every set accepted in polynomial time by a randomized Turing machine has small circuits. Both these results are typical of the known relationships between uniform and nonuniform complexity bounds. They obtain a nonuniform upper bound as a consequence of a uniform upper bound. The central theme here is an attempt to explore the converse direction. That is, we wish to understand when nonuniform upper bounds can be used to obtain uniform upper bounds. In this section we will define our basic notion of nonuniform complexity. Then we will show how to relate it to more common notions.