Unary Coded NP-Complete Languages in Aspace(log log n).
Viliam GeffertDana PardubskáPublished in: Int. J. Found. Comput. Sci. (2013)
Keyphrases
- np complete
- randomly generated
- log log
- np hard
- pairwise
- computational complexity
- satisfiability problem
- worst case
- multi lingual
- expressive power
- lower bound
- pspace complete
- conjunctive queries
- cross lingual
- constraint satisfaction problems
- grammatical inference
- language identification
- polynomial time complexity
- language independent
- data complexity
- phase transition
- statistical machine translation
- first order logic
- bounded treewidth
- np complete problems
- query processing