CNF Satisfiability in a Subspace and Related Problems
暂无分享,去创建一个
[1] Venkatesan Guruswami,et al. CSPs with global modular constraints: algorithms and hardness via polynomial representations , 2019, Electron. Colloquium Comput. Complex..
[2] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.
[3] Magnus Wahlström,et al. Which NP-Hard SAT and CSP Problems Admit Exponentially Improved Algorithms? , 2018, ArXiv.
[4] Rahul Santhanam,et al. Satisfiability on Mixed Instances , 2016, ITCS.
[5] Russell Impagliazzo,et al. Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[6] Michael R. Fellows,et al. On the parameterized complexity of multiple-interval graph problems , 2009, Theor. Comput. Sci..
[7] Mihai Patrascu,et al. On the possibility of faster SAT algorithms , 2010, SODA '10.
[8] U. Schöning. A probabilistic algorithm for k-SAT and constraint satisfaction problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[9] Pavel Pudlák,et al. Satisfiability Coding Lemma , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[10] Itai Dinur,et al. Improved Algorithms for Solving Polynomial Systems over GF(2) by Multiple Parity-Counting , 2020, SODA.
[11] Peter Jonsson,et al. Fine-Grained Time Complexity of Constraint Satisfaction Problems , 2021, ACM Trans. Comput. Theory.
[12] Russell Impagliazzo,et al. Complexity of k-SAT , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[13] Mate Soos,et al. BIRD: Engineering an Efficient CNF-XOR SAT Solver and Its Applications to Approximate Model Counting , 2019, AAAI.
[14] Andreas Björklund,et al. Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-Reduction , 2019, ICALP.
[15] Gustav Nordh,et al. Strong partial clones and the time complexity of SAT problems , 2017, J. Comput. Syst. Sci..
[16] Leslie G. Valiant,et al. NP is as easy as detecting unique solutions , 1985, STOC '85.
[17] Russell Impagliazzo,et al. A satisfiability algorithm for AC0 , 2012, ACM-SIAM Symposium on Discrete Algorithms.
[18] Mate Soos,et al. Tinted, Detached, and Lazy CNF-XOR Solving and Its Applications to Counting and Sampling , 2020, CAV.
[19] Erich Kaltofen,et al. Factorization of Polynomials Given by Straight-Line Programs , 1989, Adv. Comput. Res..
[20] Rainer Schuler,et al. An algorithm for the satisfiability problem of formulas in conjunctive normal form , 2005, J. Algorithms.
[21] Ewald Speckenmeyer,et al. Solving satisfiability in less than 2n steps , 1985, Discret. Appl. Math..
[22] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[23] Timothy M. Chan,et al. Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky , 2016, SODA.
[24] Jörg Flum,et al. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[25] Huacheng Yu,et al. Beating Brute Force for Systems of Polynomial Equations over Finite Fields , 2017, SODA.
[26] Russell Impagliazzo,et al. A duality between clause width and clause density for SAT , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).
[27] Venkatesan Guruswami,et al. Bridging between 0/1 and linear programming via random walks , 2019, Electron. Colloquium Comput. Complex..
[28] Miguel Couceiro,et al. Fine-Grained Complexity of Constraint Satisfaction Problems through Partial Polymorphisms: A Survey , 2019, 2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL).