Unary Coded NP-Complete Languages in ASPACE (log log n).
Viliam GeffertDana PardubskáPublished in: Developments in Language Theory (2012)
Keyphrases
- np complete
- np hard
- log log
- randomly generated
- pairwise
- satisfiability problem
- language independent
- computational complexity
- worst case
- lower bound
- pspace complete
- expressive power
- constraint satisfaction problems
- conjunctive queries
- text summarization
- polynomial time complexity
- phase transition
- data complexity
- normal form
- special case
- data model
- np complete problems
- databases