Proving SAT does not have small circuits with an application to the two queries problem.
Lance FortnowAduri PavanSamik SenguptaPublished in: J. Comput. Syst. Sci. (2008)
Keyphrases
- query processing
- query language
- response time
- high speed
- databases
- complex queries
- small number
- query logs
- analog vlsi
- database queries
- satisfiability problem
- user queries
- search algorithm
- query evaluation
- retrieval systems
- phase transition
- sat solvers
- web search engines
- query formulation
- efficient processing
- max sat
- digital circuits
- database