Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth
暂无分享,去创建一个
Pavel Pudlák | Daniel Lokshtanov | Ramamohan Paturi | Ivan Mikhailin | P. Pudlák | R. Paturi | D. Lokshtanov | I. Mikhailin
[1] Rainer Schuler,et al. An algorithm for the satisfiability problem of formulas in conjunctive normal form , 2005, J. Algorithms.
[2] Kazuo Iwama,et al. Improved Randomized Algorithms for 3-SAT , 2010, ISAAC.
[3] Periklis A. Papakonstantinou,et al. Depth-Reduction for Composites , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[4] Hans L. Bodlaender,et al. A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.
[5] Evgeny Dantsin,et al. Worst-Case Upper Bounds , 2009, Handbook of Satisfiability.
[6] Rahul Santhanam,et al. Fighting Perebor: New and Improved Algorithms for Formula and QBF Satisfiability , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[7] Pavel Pudlák,et al. Satisfiability Coding Lemma , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[8] Christophe Paul,et al. Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions , 2012, ICALP.
[9] Russell Impagliazzo,et al. A satisfiability algorithm for AC0 , 2012, ACM-SIAM Symposium on Discrete Algorithms.
[10] Mateus de Oliveira Oliveira. Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Function , 2017, Theory of Computing Systems.
[11] Russell Impagliazzo,et al. A duality between clause width and clause density for SAT , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).
[12] Russell Impagliazzo,et al. A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits , 2012, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[13] Kazuhisa Seto,et al. A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis , 2012, Computational Complexity Conference.
[14] Fedor V. Fomin,et al. Planar F-Deletion: Approximation and Optimal FPT Algorithms , 2012, ArXiv.
[15] Michael E. Saks,et al. An improved exponential-time algorithm for k-SAT , 2005, JACM.
[16] David Zuckerman,et al. Mining Circuit Lower Bound Proofs for Meta-algorithms , 2014, Computational Complexity Conference.
[17] Tamaki Suguru,et al. Beating Brute Force for Systems of Polynomial Equations over Finite Fields , 2017 .
[18] Timon Hertli,et al. 3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[19] Ewald Speckenmeyer,et al. Solving satisfiability in less than 2n steps , 1985, Discret. Appl. Math..
[20] Richard J. Lipton,et al. Multi-party protocols , 1983, STOC.
[21] Michal Pilipczuk,et al. Parameterized Algorithms , 2015, Springer International Publishing.
[22] E. Kushilevitz,et al. Communication Complexity: Basics , 1996 .
[23] Periklis A. Papakonstantinou,et al. Width-parameterized SAT: Time-Space Tradeoffs , 2011, ArXiv.
[24] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[25] Uwe Schöning,et al. A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart , 2002, Algorithmica.
[26] Ryan Williams. Improving Exhaustive Search Implies Superpolynomial Lower Bounds , 2013, SIAM J. Comput..
[27] Dominik Scheder,et al. A full derandomization of schöning's k-SAT algorithm , 2010, STOC.
[28] Dimitrios M. Thilikos,et al. (Meta) Kernelization , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.