Bayesian inductive logic programming
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Circuit complexity: from the worst case to the average case
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the learnability of discrete distributions
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Simple strategies for large zero-sum games with applications to complexity theory
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Average-case completeness of a word problem for groups
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Complete on average Boolean satisfiability
Journal of Complexity
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Some Results on Derandomization
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
The Non-Recursive Power of Erroneous Computation
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
A note on universal distributions for polynomial-time computable distributions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
LR(k) Testing is Average Case Complete
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
SIGACT news complexity theory column 40
ACM SIGACT News
Average-case intractability vs. worst-case intractability
Information and Computation
On uniform amplification of hardness in NP
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Threshold values of random K-SAT from the cavity method
Random Structures & Algorithms
On basing one-way functions on NP-hardness
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Computational depth: concept and applications
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Foundations and Trends® in Theoretical Computer Science
Using average case intractability in cryptography
AIC'04 Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications
Evolvability from learning algorithms
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Limits on the Hardness of Lattice Problems in lp Norms
Computational Complexity
Structural Complexity of AvgBPP
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
A secret sharing scheme using matrices
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Universal distributions and time-bounded kolmogorov complexity
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Distributionally-hard languages
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
SIAM Journal on Computing
On the Implementation of Huge Random Objects
SIAM Journal on Computing
Notes on Levin's theory of average-case complexity
Studies in complexity and cryptography
Average case complexity, revisited
Studies in complexity and cryptography
Alternative measures of computational complexity with applications to agnostic learning
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Hardness amplification of weakly verifiable puzzles
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Average-case non-approximability of optimisation problems
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Relations between average-case and worst-case complexity
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
An encoding invariant version of polynomial time computable distributions
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Finding the most probable string and the consensus string: an algorithmic study
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Encoding Invariance in Average Case Complexity
Theory of Computing Systems
| Hi-index | 0.00 |