Conditional Dichotomy of Boolean Ordered Promise CSPs
暂无分享,去创建一个
[1] Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing , 2018, STOC.
[2] Marc Gyssens,et al. Closure properties of constraints , 1997, JACM.
[3] Subhash Khot,et al. On independent sets, 2-to-2 games, and Grassmann graphs , 2017, Electron. Colloquium Comput. Complex..
[4] Venkatesan Guruswami,et al. Promise Constraint Satisfaction: Structure Theory and a Symmetric Boolean Dichotomy , 2018, SODA.
[5] Venkatesan Guruswami,et al. Rainbow coloring hardness via low sensitivity polymorphisms , 2019, Electron. Colloquium Comput. Complex..
[6] Venkatesan Guruswami,et al. New Hardness Results for Graph and Hypergraph Colorings , 2016, CCC.
[7] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.
[8] T. Sanders. Analysis of Boolean Functions , 2012, ArXiv.
[9] Jakub Bulín,et al. Algebraic approach to promise constraint satisfaction , 2018, STOC.
[10] Venkatesan Guruswami,et al. The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems , 2020, SIAM J. Comput..
[11] Venkatesan Guruswami,et al. (2+ε)-Sat Is NP-hard , 2014, SIAM J. Comput..
[12] Dmitriy Zhuk,et al. A Proof of CSP Dichotomy Conjecture , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[13] Ryan O'Donnell,et al. Analysis of Boolean Functions , 2014, ArXiv.
[14] Andrei A. Krokhin,et al. The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231) , 2018, Dagstuhl Reports.
[15] Marcin Kozik,et al. Dichotomy for symmetric Boolean PCSPs , 2019, ICALP.
[16] Subhash Khot,et al. On Rich $2$-to-$1$ Games , 2019, Electron. Colloquium Comput. Complex..
[17] Andrei A. Krokhin,et al. The Complexity of 3-Colouring H-Colourable Graphs , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[18] Lidia Arroyo Prieto. Acm , 2020, Encyclopedia of Cryptography and Security.
[19] Raphaël Clifford,et al. ACM-SIAM Symposium on Discrete Algorithms , 2015, SODA 2015.
[20] Martin Shubik,et al. A Method for Evaluating the Distribution of Power in a Committee System , 1954, American Political Science Review.
[21] Peter Jeavons,et al. On the Algebraic Structure of Combinatorial Problems , 1998, Theor. Comput. Sci..
[22] Stanislav Zivny,et al. Improved hardness for H-colourings of G-colourable graphs , 2019, SODA.
[23] Tomás Feder,et al. The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..
[24] L. Russo. An approximate zero-one law , 1982 .
[25] Guy Kindler,et al. On non-optimally expanding sets in Grassmann graphs , 2017, Electron. Colloquium Comput. Complex..
[26] Nicholas R. Jennings,et al. Efficient Computation of the Shapley Value for Game-Theoretic Network Centrality , 2014, J. Artif. Intell. Res..
[27] Rocco A. Servedio,et al. The Inverse Shapley value problem , 2012, Games Econ. Behav..
[28] Guy Kindler,et al. Towards a proof of the 2-to-1 games conjecture? , 2018, Electron. Colloquium Comput. Complex..
[29] Subhash Khot,et al. On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[30] Y. Narahari,et al. A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks , 2011, IEEE Transactions on Automation Science and Engineering.
[31] Subhash Khot,et al. Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[32] Nicholas Pippenger,et al. Galois theory for minors of finite functions , 1998, Discret. Math..
[33] G. Winskel. What Is Discrete Mathematics , 2007 .
[34] Peter Jeavons,et al. Classifying the Complexity of Constraints Using Finite Algebras , 2005, SIAM J. Comput..
[35] Jstor. The American political science review , 2022 .
[36] Subhash Khot,et al. Hardness results for coloring 3-colorable 3-uniform hypergraphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[37] Andrei A. Bulatov,et al. A Dichotomy Theorem for Nonuniform CSPs , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).