DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Advice (complexity)
Advice (complexity)
Time Hypothesis on a Quantum Computer the Implications Of
The Complexity Zoo
Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/Poly
The Structure of Logarithmic Advice Complexity Classes
Non-Uniform Computation
SIGACT News Complexity Theory Column 52
Circuit Complexity Contents 1 Announcements 2 Relation to Other
Linear Advice for Randomized Logarithmic Space
18.405J S16 Lecture 3: Circuits and Karp-Lipton
Complexity Classes
Locating P/Poly Optimally in the Extended Low Hierarchy
Some Estimated Likelihoods for Computational Complexity
Lecture 9: Nonuniformity 1 Time-Space Lower Bounds for SAT
Lecture 10: Boolean Circuits (Cont.) 1 Recap 2 Turing Machines with Advice
Advice Complexity for a Class of Online Problems∗
On Exponential-Time Hypotheses, Derandomization, and Circuit
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds [Extended Abstract]
Lecture Notes: Boolean Circuits
Top View
Hierarchies Against Sublinear Advice
Symmetry of Information and Nonuniform Lower Bounds
Computability and Complexity of Unconventional Computing Devices
6.845 Quantum Complexity Theory, Lecture 20
Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-Reducibility
1. Introduction a Hierarchy Theorem States That the Power of a Machine Increases with the Amount of Resources It Can Use
Languages to Diagonalize Against Advice Classes
Some Results on the Circuit Complexity of Bounded Width
Block Rigidity: Strong Multiplayer Parallel Repetition Implies Super
Time Hierarchies: a Survey∗
Complexity Classes Chapter 27 of the Forthcoming CRC Handbook on Algorithms and Theory of Computation
A Generic Time Hierarchy with One Bit of Advice
Advice DRAFT 1 Advice and Nonuniform Computation Models
Lecture 3 1 Overview 2 Turing Machines with Advice
Unconditional Lower Bounds Against Advice
A Full Characterization of Quantum Advice
Other Complexity Classes and Measures Chapter 29 of the Forthcoming CRC Handbook on Algorithms and Theory of Computation
Which Problems Have Strongly Exponential Complexity?1
Neural and Super-Turing Computing
Unconditional Lower Bounds Against Advice
UC San Diego UC San Diego Electronic Theses and Dissertations
NP with Small Advice
Hierarchies for Semantic Classes
Diagonalization, Time Hierarchy
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds
Time Hierarchy Theorems 1 Diagonalization Arguments