The complexity of satisfiability of small depth circuits

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5917 LNCS, Issue , 2009, Pages 75-85

  Calabro, Chris ^a   Impagliazzo, Russell ^a   Paturi, Ramamohan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN SATISFIABILITY PROBLEMS; BRUTE FORCE SEARCH; GROVER'S ALGORITHM; NUMBER OF GATES; RANDOMIZED ALGORITHMS; RUNNING TIME; RUNTIMES; SATISFIABILITY; SATISFIABILITY PROBLEMS;

BOOLEAN FUNCTIONS; QUANTUM COMPUTERS;

ALGORITHMS;

EID: 72249083786     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11269-0_6     Document Type: Conference Paper

References (15)

1. [BBHT96] Boyer, M., Brassard, G., Høyer, P., Tapp, A.: Tight bounds on quantum searching (May 1996)
2. [Cal08] Calabro, C.: A lower bound on the size of series-parallel graphs dense in long paths. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 15(110) (2008)
3. [CIKP08] Calabro, C., Impagliazzo, R., Kabanets, V., Paturi, R.: The complexity of unique k-sat: An isolation lemma for k-cnfs. J. Comput. Syst. Sci. 74(3), 386-393 (2008)
4. [CIP06] Calabro, C., Impagliazzo, R., Paturi, R.: A duality between clause width and clause density for sat. In: CCC 2006: Proceedings of the 21st Annual IEEE Conference on Computational Complexity, Washington, DC, USA, 2006, pp. 252-260. IEEE Computer Society Press, Los Alamitos (2006)
5. [DW05] Dantsin, E., Wolpert, A.: An improved upper bound for sat. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 400-407. Springer, Heidelberg (2005)
6. [Gro96] Grover, L.K.: A fast quantum mechanical algorithm for database search. In: STOC, pp. 212-219 (1996)
7. [IP01] Impagliazzo, R., Paturi, R.: On the complexity of k-sat. J. Comput. Syst. Sci. 62(2), 367-375 (2001)
8. [IPZ01] Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512-530 (2001)
9. [Nur09] Nurik, S.: Personal communication. To appear in ECCC (2009)
10. [PPSZ05] Paturi, R., Pudlák, P., Saks, M.E., Zane, F.: An improved exponentialtime algorithm for k-sat. J. ACM 52(3), 337-364 (2005)
11. [PPZ99] Paturi, R., Pudlák, P., Zane, F.: Satisfiability coding lemma. Chicago Journal of Theoretical Computer Science 115 ( December 1999)
12. [PSZ00] Paturi, R., Saks, M.E., Zane, F.: Exponential lower bounds for depth 3 boolean circuits. Computational Complexity 9(1), 1-15 (2000); Preliminary version in 29th annual ACM Symposium on Theory of Computing, pp. 96-91 (1997)
13. [Sch99] Schöning, U.: A probabilistic algorithm for k-sat and constraint satisfaction problems. In: FOCS, pp. 410-414 (1999)
14. [Sch05] Schuler, R.: An algorithm for the satisfiability problem of formulas in conjunctive normal form. J. Algorithms 54(1), 40-44 (2005)
15. [Val77] Valiant, L.: Graph-theoretic arguments in low level complexity. In: Gruska, J. (ed.) MFCS 1977. LNCS, vol. 53, Springer, Heidelberg (1977)