On the public citation graph

Approximating Satisfiable Satisfiability Problems

0 signed · 57 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jagm.1994.1045openalex-snapshot
On the Approximation of Maximum Satisfiability
inferredcites →https://doi.org/10.1006/jcss.1995.1087openalex-snapshot
A Dichotomy Theorem for Maximum Generalized Satisfiability Problems
inferredcites →https://doi.org/10.1007/3-540-61680-2_47openalex-snapshot
Positive linear programming, parallel approximation and PCP's
inferredcites →https://doi.org/10.1007/bf02392825openalex-snapshot
Clique is hard to approximate within n1−ε
inferredcites →https://doi.org/10.1016/0022-0000(91)90023-xopenalex-snapshot
Optimization, approximation, and complexity classes
inferredcites →https://doi.org/10.1016/s0020-0190(98)00021-0openalex-snapshot
Better approximation algorithms for Set Splitting and Not-All-Equal Sat
inferredcites →https://doi.org/10.1016/s0022-0000(74)80044-9openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.1016/s0304-3975(98)00200-xopenalex-snapshot
Max NP-completeness made easy
inferredcites →https://doi.org/10.1109/ccc.1997.612322openalex-snapshot
Tight bound on Johnson's algorithm for Max-SAT
inferredcites →https://doi.org/10.1109/istcs.1995.377033openalex-snapshot
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
inferredcites →https://doi.org/10.1109/istcs.1997.595154openalex-snapshot
Approximation algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson
inferredcites →https://doi.org/10.1109/sfcs.1995.492573openalex-snapshot
Free bits, PCPs and non-approximability-towards tight results
inferredcites →https://doi.org/10.1109/sfcs.1996.548521openalex-snapshot
Gadgets, approximation, and linear programming
inferredcites →https://doi.org/10.1109/sfcs.1997.646129openalex-snapshot
A 7/8-approximation algorithm for MAX 3SAT?
inferredcites →https://doi.org/10.1109/sfcs.1998.743424openalex-snapshot
A tight characterization of NP with 3 query PCPs
inferredcites →https://doi.org/10.1137/s0097539795286612openalex-snapshot
On Syntactic versus Computational Views of Approximability
inferredcites →https://doi.org/10.1137/s0895480192243516openalex-snapshot
New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
inferredcites →https://doi.org/10.1145/167088.167174openalex-snapshot
Efficient probabilistically checkable proofs and applications to approximations
inferredcites →https://doi.org/10.1145/195058.195128openalex-snapshot
Two prover protocols
inferredcites →https://doi.org/10.1145/195058.195129openalex-snapshot
Improved non-approximability results
inferredcites →https://doi.org/10.1145/226643.226652openalex-snapshot
Interactive proofs and the hardness of approximating cliques
inferredcites →https://doi.org/10.1145/227683.227684openalex-snapshot
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
inferredcites →https://doi.org/10.1145/237814.237820openalex-snapshot
Testing of the long code and hardness for clique
inferredcites →https://doi.org/10.1145/258533.258536openalex-snapshot
Some optimal inapproximability results
inferredcites →https://doi.org/10.1145/258533.258538openalex-snapshot
A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction
inferredcites →https://doi.org/10.1145/273865.273901openalex-snapshot
Probabilistic checking of proofs
inferredcites →https://doi.org/10.1145/278298.278306openalex-snapshot
Proof verification and the hardness of approximation problems
inferredcites →https://doi.org/10.5555/314613.314701openalex-snapshot
Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint

What points at this work

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

inferred← citeshttps://doi.org/10.1002/rsa.20050openalex-snapshot
Three‐query PCPs with perfect completeness over non‐Boolean domains
inferred← citeshttps://doi.org/10.1006/jagm.2001.1162openalex-snapshot
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
inferred← citeshttps://doi.org/10.1006/jcss.1998.1612openalex-snapshot
Tight Bound on Johnson's Algorithm for Maximum Satisfiability
inferred← citeshttps://doi.org/10.1007/0-387-23830-1_3openalex-snapshot
Probabilistic Verification and Non-Approximability
inferred← citeshttps://doi.org/10.1007/11427186_32openalex-snapshot
GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/11523468_77openalex-snapshot
Approximating Max kCSP – Outperforming a Random Assignment with Almost a Linear Factor
inferred← citeshttps://doi.org/10.1007/11538462_12openalex-snapshot
Beating a Random Assignment
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_28openalex-snapshot
On the Complexity of Approximating Colored-Graph Problems Extended Abstract
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_16openalex-snapshot
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-27821-4_14openalex-snapshot
Approximating Max k CSP Using Random Restrictions
inferred← citeshttps://doi.org/10.1007/978-3-642-22685-4_5openalex-snapshot
Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems
inferred← citeshttps://doi.org/10.1007/s00453-022-00938-8openalex-snapshot
A Refined Branching Algorithm for the Maximum Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/s12532-016-0107-9openalex-snapshot
A nonmonotone GRASP
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00030-xopenalex-snapshot
Reactive local search techniques for the maximum k-conjunctive constraint satisfaction problem (MAX-k-CCSP)
inferred← citeshttps://doi.org/10.1080/0952813021000026795openalex-snapshot
Consistent subsets of inconsistent systems: structure and behaviour
inferred← citeshttps://doi.org/10.1109/ccc.2003.1214428openalex-snapshot
Three-query PCPs with perfect completeness over non-Boolean domains
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959937openalex-snapshot
Query efficient PCPs with perfect completeness
inferred← citeshttps://doi.org/10.1145/1187436.1216581openalex-snapshot
GRASP with path relinking for the weighted MAXSAT problem
inferred← citeshttps://doi.org/10.1145/2488608.2488666openalex-snapshot
Approximation resistance on satisfiable instances for predicates with few accepting inputs
inferred← citeshttps://doi.org/10.1145/276698.276869openalex-snapshot
Finding almost-satisfying assignments
inferred← citeshttps://doi.org/10.1145/299432.299462openalex-snapshot
Identifying gene regulatory networks from experimental data
inferred← citeshttps://doi.org/10.1145/301250.301431openalex-snapshot
Outward rotations
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/3459668openalex-snapshot
The Quest for Strong Inapproximability Results with Perfect Completeness
inferred← citeshttps://doi.org/10.1360/jos172029openalex-snapshot
Research and Development of Distributed Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.3724/sp.j.1016.2010.01127openalex-snapshot
The Local Search Algorithms for Maximum 3-Satisfiablility Problem
inferred← citeshttps://doi.org/10.4086/toc.2005.v001a007openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2014.v010a014openalex-snapshot
inferred← citeshttps://doi.org/10.5555/1496770.1496811openalex-snapshot
3-bit dictator testing: 1 vs. 5/8
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.