One-way functions, robustness, and the non-isomorphism of NP-complete sets.
Juris HartmanisLane A. HemachandraPublished in: Computational Complexity Conference (1987)
Keyphrases
- np complete
- randomly generated
- semi algebraic
- np hard
- satisfiability problem
- logical equivalence
- computational complexity
- constraint satisfaction problems
- polynomial time complexity
- np complete problems
- computational efficiency
- pspace complete
- phase transition
- high robustness
- bounded treewidth
- real time
- query language
- social networks
- search engine