Connections between the Complexity of Unique Satisfiability and the Threshold Behavior of Randomized Reductions.
Richard ChangJim KadinPankaj RohatgiPublished in: Computational Complexity Conference (1991)
Keyphrases
- computational complexity
- worst case
- np complete
- computational cost
- efficient computation
- decision procedures
- complexity analysis
- cellular automata
- satisfiability problem
- propositional logic
- threshold selection
- data mining
- behavior analysis
- human behavior
- special case
- objective function
- information systems
- artificial intelligence