Combining LPs and Ring Equations via Structured Polymorphisms
暂无分享,去创建一个
[1] Nicholas Pippenger,et al. Galois theory for minors of finite functions , 1998, Discret. Math..
[2] 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..
[3] Ryan O'Donnell,et al. Linear programming, width-1 CSPs, and robust satisfaction , 2012, ITCS '12.
[4] A BulatovAndrei. A dichotomy theorem for constraint satisfaction problems on a 3-element set , 2006 .
[5] 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).
[6] Guy Kindler,et al. Towards a proof of the 2-to-1 games conjecture? , 2018, Electron. Colloquium Comput. Complex..
[7] Ravi Kannan,et al. Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix , 1979, SIAM J. Comput..
[8] Sangxia Huang,et al. Improved Hardness of Approximating Chromatic Number , 2013, APPROX-RANDOM.
[9] Libor Barto,et al. Polymorphisms, and How to Use Them , 2017, The Constraint Satisfaction Problem.
[10] Prasad Raghavendra,et al. Optimal algorithms and inapproximability results for every CSP? , 2008, STOC.
[11] Colin McDiarmid,et al. A Random Recolouring Method for Graphs and Hypergraphs , 1993, Combinatorics, Probability and Computing.
[12] Ryan O'Donnell,et al. Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? , 2007, SIAM J. Comput..
[13] Hubie Chen. A rendezvous of logic, complexity, and algebra , 2006, SIGA.
[14] Gustav Nordh,et al. Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis , 2013, SODA.
[15] Subhash Khot,et al. On independent sets, 2-to-2 games, and Grassmann graphs , 2017, Electron. Colloquium Comput. Complex..
[16] Stanislav Zivny,et al. The Complexity of Finite-Valued CSPs , 2016, J. ACM.
[17] Venkatesan Guruswami,et al. (2+ε)-Sat Is NP-hard , 2014, SIAM J. Comput..
[18] Venkatesan Guruswami,et al. New Hardness Results for Graph and Hypergraph Colorings , 2016, CCC.
[19] Peter Jeavons,et al. Classifying the Complexity of Constraints Using Finite Algebras , 2005, SIAM J. Comput..
[20] Prasad Raghavendra,et al. Combinatorial Optimization Algorithms via Polymorphisms , 2015, Electron. Colloquium Comput. Complex..
[21] Peter A. Beling,et al. Exact Algorithms for Linear Programming over Algebraic Extensions , 2001, Algorithmica.
[22] Guy Kindler,et al. On non-optimally expanding sets in Grassmann graphs , 2017, Electron. Colloquium Comput. Complex..
[23] Peter A. Beling,et al. Polynomial algorithms for linear programming over the algebraic numbers , 1992, STOC '92.
[24] N. Alon,et al. Graph Products, Fourier Analysis and Spectral Techniques , 2004 .
[25] Peter A. Beling,et al. Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[26] Venkatesan Guruswami,et al. Promise Constraint Satisfaction: Structure Theory and a Symmetric Boolean Dichotomy , 2018, SODA.
[27] Venkatesan Guruswami,et al. On the Hardness of 4-Coloring a 3-Colorable Graph , 2004, SIAM J. Discret. Math..
[28] Andrei A. Bulatov,et al. A Dichotomy Theorem for Nonuniform CSPs , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[29] Nathan Linial,et al. On the Hardness of Approximating the Chromatic Number , 2000, Comb..
[30] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.