How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
How to construct random functions
Journal of the ACM (JACM)
Average case complete problems
SIAM Journal on Computing
Expected computation time for Hamiltonian path problem
SIAM Journal on Computing
On the theory of average case complexity
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On generating solved instances of computational problems
CRYPTO '88 Proceedings on Advances in cryptology
Average case intractability of matrix and diophantine problems (extended abstract)
STOC '92 Proceedings of the twenty-fourth 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
Fundamentals of computing (a cheatlist)
ACM SIGACT News
Solving the Minimum Weighted Integer Coloring Problem
Computational Optimization and Applications
Hiding cliques for cryptographic security
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Hiding Cliques for Cryptographic Security
Designs, Codes and Cryptography
Complete on average Boolean satisfiability
Journal of Complexity
Spanning Subgraphs of Random Graphs
Combinatorics, Probability and Computing
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
Computational Complexity
Using average case intractability in cryptography
AIC'04 Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications
A secret sharing scheme using matrices
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Fast digital signature algorithm based on subgraph isomorphism
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
Review: Measuring instance difficulty for combinatorial optimization problems
Computers and Operations Research
Notes on Levin's theory of average-case complexity
Studies in complexity and cryptography
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |
NP-complete problems should be hard on some (may be extremely rare) instances. But on generic instances many such problems (especially related to random graphs) have been proven easy. We show the intractability of random instances of a graph coloring problem by modifying the NP-completeness theorem.