Abstract :
The following topics are dealt with: polynomial time; min-max problems; CNF-SAT hard problems; faster deterministic counting algorithm; communication complexity; satisfiability algorithm; information complexity; information retrieval; Boolean operators wire complexity; time-space lower bounds; minimal multiplicative complexity; geometric complexity theory; and space complexity.
Keywords :
Boolean algebra; computability; computational complexity; computational geometry; information retrieval; CNF-SAT hard problems; communication complexity; faster deterministic counting algorithm; geometric complexity theory; min-max problems; minimal multiplicative complexity; polynomial time; satisfiability algorithm; space complexity; time-space lower bounds;
Conference_Titel :
Computational Complexity (CCC), 2012 IEEE 27th Annual Conference on
Conference_Location :
Porto
Print_ISBN :
978-1-4673-1663-7
DOI :
10.1109/CCC.2012.48
