MAX3SAT is exponentially hard to approximate if NP has positive dimension
Theoretical Computer Science
Measure Theoretic Completeness Notions for the Exponential Time Classes
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
On the Construction of Effective Random Sets
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
The Global Power of Additional Queries to p-Random Oracles
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Why Computational Complexity Requires Stricter Martingales
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Baire Category and Nowhere Differentiability for Feasible Real Functions
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Hard Instances of Hard Problems
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Bias Invariance of Small Upper Spans
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Strong Reductions and Immunity for Exponential Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On Distribution-Specific Learning with Membership Queries versus Pseudorandom Generation
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A stronger Kolmogorov zero-one law for resource-bounded measure
Theoretical Computer Science - Algorithms,automata, complexity and games
Gales suffice for constructive dimension
Information Processing Letters
Information and Computation
Separating NP-Completeness Notions Under Strong Hypotheses
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The Density of Weakly Complete Problems under Adaptive Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
SIGACT news complexity theory column 40
ACM SIGACT News
Theoretical Computer Science
Theoretical Computer Science
Theoretical Computer Science
Scaled dimension and nonuniform complexity
Journal of Computer and System Sciences
Information and Computation
SIGACT news complexity theory column 48
ACM SIGACT News
Resource-bounded strong dimension versus resource-bounded category
Information Processing Letters
Reviewing bounds on the circuit size of the hardest functions
Information Processing Letters
Dimension, entropy rates, and compression
Journal of Computer and System Sciences
A note on dimensions of polynomial size circuits
Theoretical Computer Science
Comparing reductions to NP-complete sets
Information and Computation
Upward separations and weaker hypotheses in resource-bounded measure
Theoretical Computer Science
Generic density and small span theorem
Information and Computation
Baire categories on small complexity classes and meager--comeager laws
Information and Computation
A Characterization of Constructive Dimension
Electronic Notes in Theoretical Computer Science (ENTCS)
Resource-bounded measure on probabilistic classes
Information Processing Letters
Martingale families and dimension in P
Theoretical Computer Science
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
A zero-one law for RP and derandomization of AM if NP is not small
Information and Computation
Quantitative Aspects of Speed-Up and Gap Phenomena
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Information and Computation
Reviewing bounds on the circuit size of the hardest functions
Information Processing Letters
Resource-bounded strong dimension versus resource-bounded category
Information Processing Letters
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Scaled dimension and nonuniform complexity
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Strong reductions and isomorphism of complete sets
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Weak completeness notions for exponential time
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Quantitative aspects of speed-up and gap phenomena
Mathematical Structures in Computer Science
A zero-one SUBEXP-dimension law for BPP
Information Processing Letters
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
Functions that preserve p-randomness
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Axiomatizing resource bounds for measure
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Online learning and resource-bounded dimension: winnow yields new lower bounds for hard sets
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Martingale families and dimension in p
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Extracting kolmogorov complexity with applications to dimension zero-one laws
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Comparing reductions to NP-complete sets
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Generic density and small span theorem
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Hardness hypotheses, derandomization, and circuit complexity
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Dimension, halfspaces, and the density of hard sets
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
On the polynomial depth of various sets of random strings
Theoretical Computer Science
Base invariance of feasible dimension
Information Processing Letters
Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds
ACM Transactions on Computation Theory (TOCT)
Functions that preserve p-randomness
Information and Computation
| Hi-index | 0.01 |