On the public citation graph

A Dichotomy Theorem for Maximum Generalized Satisfiability Problems

0 signed · 112 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118600207.ch1openalex-snapshot
Optimal Satisfiability
inferred← citeshttps://doi.org/10.1002/9781118600207.ch13openalex-snapshot
Inapproximability of Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1002/9781119005353.biblioopenalex-snapshot
General Bibliography
inferred← citeshttps://doi.org/10.1002/9781119005353.ch1openalex-snapshot
Optimal Satisfiability
inferred← citeshttps://doi.org/10.1002/9781119005353.ch13openalex-snapshot
Inapproximability of Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1006/inco.2002.2903openalex-snapshot
Parallel Approximation Schemes for a Class of Planar and Near Planar Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1007/11538462_12openalex-snapshot
Beating a Random Assignment
inferred← citeshttps://doi.org/10.1007/11549345_12openalex-snapshot
Isomorphic Implication
inferred← citeshttps://doi.org/10.1007/11564751_30openalex-snapshot
Maximum Constraint Satisfaction on Diamonds
inferred← citeshttps://doi.org/10.1007/11602613_63openalex-snapshot
On the Complexity of Global Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/11786986_31openalex-snapshot
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
inferred← citeshttps://doi.org/10.1007/11814948_23openalex-snapshot
A Dichotomy Theorem for Typed Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/11889205_10openalex-snapshot
An Algebraic Characterisation of Complexity for Valued Constraint
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_59openalex-snapshot
Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_36openalex-snapshot
The Complexity of Minimal Satisfiability Problems
inferred← citeshttps://doi.org/10.1007/3-540-45402-0_3openalex-snapshot
On The Complexity of Model Checking and Inference in Minimal Models
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_2openalex-snapshot
Towards a Predictive Computational Complexity Theory
inferred← citeshttps://doi.org/10.1007/3-540-45793-3_28openalex-snapshot
Equivalence and Isomorphism for Boolean Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/3-540-46769-6_25openalex-snapshot
Boolean Formulas Are Hard to Learn for Most Gate Bases
inferred← citeshttps://doi.org/10.1007/3-540-61739-6_48openalex-snapshot
Tractable constraints in finite semilattices
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_36openalex-snapshot
Approximating satisfiable satisfiability problems
inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_15openalex-snapshot
The Complexity of Boolean Constraint Isomorphism
inferred← citeshttps://doi.org/10.1007/978-3-540-30215-5_28openalex-snapshot
Learnability of Relatively Quantified Generalized Formulas
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_27openalex-snapshot
Tractability by Approximating Constraint Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_20openalex-snapshot
On the Boolean Connectivity Problem for Horn Relations
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_10openalex-snapshot
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
inferred← citeshttps://doi.org/10.1007/978-3-540-92800-3_2openalex-snapshot
Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?
inferred← citeshttps://doi.org/10.1007/978-3-642-12200-2_30openalex-snapshot
On Quadratic Threshold CSPs
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_23openalex-snapshot
An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_18openalex-snapshot
On Minimal Weighted Clones
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_47openalex-snapshot
Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_6openalex-snapshot
Max-Sur-CSP on Two Elements
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_27openalex-snapshot
Constant Unary Constraints and Symmetric Real-Weighted Counting CSPs
inferred← citeshttps://doi.org/10.1007/bfb0028584openalex-snapshot
The (parallel) approximability of non-boolean satisfiability problems and restricted integer programming
inferred← citeshttps://doi.org/10.1007/s00037-005-0195-9openalex-snapshot
Parameterized complexity of constraint satisfaction problems
inferred← citeshttps://doi.org/10.1007/s00145-020-09363-yopenalex-snapshot
PCPs and the Hardness of Generating Synthetic Data
inferred← citeshttps://doi.org/10.1007/s00224-004-1152-8openalex-snapshot
A Dichotomy in the Complexity of Propositional Circumscription
inferred← citeshttps://doi.org/10.1007/s00224-007-9038-1openalex-snapshot
Isomorphic Implication
inferred← citeshttps://doi.org/10.1007/s00224-013-9518-4openalex-snapshot
Constant Unary Constraints and Symmetric Real-Weighted Counting Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/s00453-017-0310-8openalex-snapshot
Complexity and Approximability of Parameterized MAX-CSPs
inferred← citeshttps://doi.org/10.1007/s004530010035openalex-snapshot
Approximating Satisfiable Satisfiability Problems
inferred← citeshttps://doi.org/10.1007/s10472-004-9419-yopenalex-snapshot
The Complexity of Boolean Constraint Satisfaction Local Search Problems
inferred← citeshttps://doi.org/10.1007/s10601-007-9037-5openalex-snapshot
Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency
inferred← citeshttps://doi.org/10.1016/j.artint.2006.04.002openalex-snapshot
The complexity of soft constraint satisfaction
inferred← citeshttps://doi.org/10.1016/j.artint.2007.12.001openalex-snapshot
Domain permutation reduction for constraint satisfaction problems
inferred← citeshttps://doi.org/10.1016/j.dam.2005.03.003openalex-snapshot
Supermodular functions and the complexity of MAX CSP
inferred← citeshttps://doi.org/10.1016/j.dam.2010.08.019openalex-snapshot
On the Boolean connectivity problem for Horn relations
inferred← citeshttps://doi.org/10.1016/j.dam.2018.05.011openalex-snapshot
Selecting and covering colored points
inferred← citeshttps://doi.org/10.1016/j.disopt.2007.08.001openalex-snapshot
Linear-programming design and analysis of fast algorithms for Max 2-CSP
inferred← citeshttps://doi.org/10.1016/j.disopt.2011.04.001openalex-snapshot
On the complexity of submodular function minimisation on diamonds
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.02.001openalex-snapshot
Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.10.014openalex-snapshot
The approximability of non-Boolean satisfiability problems and restricted integer programming
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.03.015openalex-snapshot
Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.05.022openalex-snapshot
Hard constraint satisfaction problems have hard gaps at location 1
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00163-xopenalex-snapshot
Complexity versus stability for classes of propositional formulas
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00343-0openalex-snapshot
Boolean constraint satisfaction: complexity results for optimization problems with arbitrary weights
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00092-0openalex-snapshot
Optimal satisfiability for propositional calculi and constraint satisfaction problems
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00324-5openalex-snapshot
Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1023/a:1007582729656openalex-snapshot
A Dichotomy Theorem for Learning Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1109/ccc.1997.612323openalex-snapshot
Constraint satisfaction: the approximability of minimization problems
inferred← citeshttps://doi.org/10.1109/ccc.2004.1313823openalex-snapshot
Parameterized complexity of constraint satisfaction problems
inferred← citeshttps://doi.org/10.1109/ccc.2004.22openalex-snapshot
Parameterized complexity of constraint satisfaction problems
inferred← citeshttps://doi.org/10.1109/focs.2014.21openalex-snapshot
Complexity Classification of Local Hamiltonian Problems
inferred← citeshttps://doi.org/10.1109/ismvl.2019.00037openalex-snapshot
Fine-Grained Complexity of Constraint Satisfaction Problems through Partial Polymorphisms: A Survey
inferred← citeshttps://doi.org/10.1109/lics.2001.932484openalex-snapshot
A dichotomy in the complexity of propositional circumscription
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743425openalex-snapshot
Probabilistically checkable proofs with low amortized query complexity
inferred← citeshttps://doi.org/10.1126/science.aab3326openalex-snapshot
Simple universal models capture all classical spin physics
inferred← citeshttps://doi.org/10.1137/07070440xopenalex-snapshot
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch25openalex-snapshot
Hierarchies of Minion Tests for PCSPs through Tensors
inferred← citeshttps://doi.org/10.1137/130906398openalex-snapshot
An Algebraic Theory of Complexity for Discrete Optimization
inferred← citeshttps://doi.org/10.1137/140998287openalex-snapshot
Complexity Classification of Local Hamiltonian Problems
inferred← citeshttps://doi.org/10.1137/16m1079245openalex-snapshot
The Power of Sherali--Adams Relaxations for General-Valued CSPs
inferred← citeshttps://doi.org/10.1137/s009753970444644xopenalex-snapshot
The Approximability of Three-valued MAX CSP
inferred← citeshttps://doi.org/10.1137/s0097539799349948openalex-snapshot
The Approximability of Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1142/9789812703118_0014openalex-snapshot
The Complexity of Problems Defined by Boolean Circuits
inferred← citeshttps://doi.org/10.1145/1060590.1060700openalex-snapshot
Every 2-CSP allows nontrivial approximation
inferred← citeshttps://doi.org/10.1145/1391289.1391290openalex-snapshot
The approximability of MAX CSP with fixed-value constraints
inferred← citeshttps://doi.org/10.1145/1536414.1536482openalex-snapshot
Conditional hardness for satisfiable 3-CSPs
inferred← citeshttps://doi.org/10.1145/1805950.1805954openalex-snapshot
Nonuniform Boolean constraint satisfaction problems with cardinality constraint
inferred← citeshttps://doi.org/10.1145/1807085.1807113openalex-snapshot
Computing query probability with incidence algebras
inferred← citeshttps://doi.org/10.1145/2450142.2450146openalex-snapshot
The complexity of conservative valued CSPs
inferred← citeshttps://doi.org/10.1145/2488608.2488697openalex-snapshot
The complexity of finite-valued CSPs
inferred← citeshttps://doi.org/10.1145/258533.258538openalex-snapshot
A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction
inferred← citeshttps://doi.org/10.1145/2591796.2591863openalex-snapshot
Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions
inferred← citeshttps://doi.org/10.1145/267460.267496openalex-snapshot
A dichotomy theorem for learning quantified Boolean formulas
inferred← citeshttps://doi.org/10.1145/276698.276769openalex-snapshot
Recycling queries in PCPs and in linearity tests (extended abstract)
inferred← citeshttps://doi.org/10.1145/276698.276784openalex-snapshot
The approximability of NP-hard problems
inferred← citeshttps://doi.org/10.1145/276698.276869openalex-snapshot
Finding almost-satisfying assignments
inferred← citeshttps://doi.org/10.1145/2974019openalex-snapshot
The Complexity of Finite-Valued CSPs
inferred← citeshttps://doi.org/10.1145/3014587openalex-snapshot
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
inferred← citeshttps://doi.org/10.1145/3282429openalex-snapshot
The Complexity of Boolean Surjective General-Valued CSPs
inferred← citeshttps://doi.org/10.1145/335305.335329openalex-snapshot
A PCP characterization of NP with optimal amortized query complexity
inferred← citeshttps://doi.org/10.1145/3624704openalex-snapshot
Optimal Polynomial-Time Compression for Boolean Max CSP
inferred← citeshttps://doi.org/10.1145/3799414openalex-snapshot
Hierarchies of Minion Tests for PCSPs through Tensors
inferred← citeshttps://doi.org/10.1145/384101.384126openalex-snapshot
Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures
inferred← citeshttps://doi.org/10.1145/568425.568432openalex-snapshot
SIGACT news complexity theory column 34
inferred← citeshttps://doi.org/10.1145/970831.970840openalex-snapshot
SIGACT news complexity theory column 43
inferred← citeshttps://doi.org/10.1587/transinf.e93.d.233openalex-snapshot
Query-Number Preserving Reductions and Linear Lower Bounds for Testing
inferred← citeshttps://doi.org/10.1613/jair.1.15604openalex-snapshot
Using Constraint Propagation to Bound Linear Programs
inferred← citeshttps://doi.org/10.3384/diss.diva-116859openalex-snapshot
On Some Combinatorial Optimization Problems : Algorithms and Complexity
inferred← citeshttps://doi.org/10.4086/toc.2016.v012a020openalex-snapshot
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2014.274openalex-snapshot
Universal Factor Graphs for Every NP-Hard Boolean CSP
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2020.27openalex-snapshot
Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction
inferred← citeshttps://doi.org/10.46298/dmtcs.591openalex-snapshot
On quadratic threshold CSPs
inferred← citeshttps://doi.org/10.48550/arxiv.1008.1555openalex-snapshot
The complexity of conservative finite-valued CSPs
inferred← citeshttps://doi.org/10.48550/arxiv.1008.4035openalex-snapshot
A dichotomy theorem for conservative general-valued CSPs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0406006openalex-snapshot
Dichotomy Theorems for Alternation-Bounded Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0604080openalex-snapshot
Linear-programming design and analysis of fast algorithms for Max 2-Sat and Max 2-CSP
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0609072openalex-snapshot
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9809116openalex-snapshot
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae
inferred← citeshttps://doi.org/10.5555/2884435.2884549openalex-snapshot
Discovering archipelagos of tractability for constraint satisfaction and counting
inferred← citeshttps://doi.org/10.5555/314613.314701openalex-snapshot
Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.