On the Length of Programs for Computing Finite Binary Sequences
Journal of the ACM (JACM)
A Theory of Program Size Formally Identical to Information Theory
Journal of the ACM (JACM)
On the Generation of Cryptographically Strong Pseudo-Random Sequences
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Riemann's Hypothesis and tests for primality
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
An information-theoretic approach to time bounds for on-line computation (preliminary version)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Borel sets and circuit complexity
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
PROBABILISTIC ALGORITHM IN FINITE FIELDS
PROBABILISTIC ALGORITHM IN FINITE FIELDS
How to construct random functions
Journal of the ACM (JACM)
Private coins versus public coins in interactive proof systems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
NP is as easy as detecting unique solutions
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Some consequences of the existence of pseudorandom generators
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The complexity of perfect zero-knowledge
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Probabilistic computation and linear time
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the theory of average case complexity
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy
Journal of the ACM (JACM)
A basic theory of public and private cryptosystems (invited talk)
CRYPTO '88 Proceedings on Advances in cryptology
The computational complexity of universal hashing
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Not all keys can be hashed in constant time
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Making zero-knowledge provers efficient
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Oracles and queries that are sufficient for exact learning (extended abstract)
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Combinatorial techniques for universal hashing
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Computational complexity and knowledge complexity (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The amazing power of pairwise independence (abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Adaptive zero knowledge and computational equivocation (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On relationships between statistical zero-knowledge proofs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
NP might not be as easy as detecting unique solutions
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Algorithmic derandomization via complexity theory
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Reductions in streaming algorithms, with an application to counting triangles in graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The complexity of approximate counting
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Optimal proof systems imply complete sets for promise classes
Information and Computation
Average-case intractability vs. worst-case intractability
Information and Computation
Beyond NP: the work and legacy of Larry Stockmeyer
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Improved range-summable random variable construction algorithms
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Resource bounded symmetry of information revisited
Theoretical Computer Science - Mathematical foundations of computer science 2004
Computational depth: concept and applications
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Language compression and pseudorandom generators
Computational Complexity
Foundations of cryptography: a primer
Foundations and Trends® in Theoretical Computer Science
Pairwise independence and derandomization
Foundations and Trends® in Theoretical Computer Science
Error-bounded probabilistic computations between MA and AM
Journal of Computer and System Sciences
Journal of Computer and System Sciences
A survey of lower bounds for satisfiability and related problems
Foundations and Trends® in Theoretical Computer Science
Perfect zero-knowledge languages can be recognized in two rounds
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Interactive proof systems: Provers that never fail and random selection
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
MFCS '08 Proceedings of the 33rd international symposium on Mathematical 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
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Nearly bounded error probabilistic sets
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
One-sided versus two-sided error in probabilistic computation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Slightly beyond Turing's computability for studying genetic programming
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Generation complexity versus distinction complexity
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
Solvable Group Isomorphism Is (Almost) in NP ∩ coNP
ACM Transactions on Computation Theory (TOCT)
Complexity classes of equivalence problems revisited
Information and Computation
Another proof that BPP ⊆ PH (and more)
Studies in complexity and cryptography
Simplified derandomization of BPP using a hitting set generator
Studies in complexity and cryptography
On the optimal compression of sets in PSPACE
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
A note on zero error algorithms having oracle access to one NP query
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Theoretical Computer Science
The complexity of quasigroup isomorphism and the minimum generating set problem
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Communication efficient secure linear algebra
TCC'06 Proceedings of the Third conference on Theory of Cryptography
The leakage-resilience limit of a computational problem is equal to its unpredictability entropy
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Hardness of approximation for quantum problems
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
Information and Computation
A scalable and nearly uniform generator of SAT witnesses
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
| Hi-index | 0.00 |
We study a time bounded variant of Kolmogorov complexity. This notion, together with universal hashing, can be used to show that problems solvable probabilistically in polynomial time are all within the second level of the polynomial time hierarchy. We also discuss applications to the theory of probabilistic constructions.