On the public citation graph
Beating a Random Assignment
0 signed · 85 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1098-2418(199608/09)9:1/2<163::aid-rsa10>3.0.co;2-popenalex-snapshot
A combinatorial design approach to MAXCUT
inferredcites →https://doi.org/10.1002/rsa.10068openalex-snapshot
Simple analysis of graph tests for linearity and PCP
inferredcites →https://doi.org/10.1006/jagm.2001.1162openalex-snapshot
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
inferredcites →https://doi.org/10.1006/jcss.1995.1087openalex-snapshot
A Dichotomy Theorem for Maximum Generalized Satisfiability Problems
inferredcites →https://doi.org/10.1007/11523468_77openalex-snapshot
Approximating Max kCSP – Outperforming a Random Assignment with Almost a Linear Factor
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-47867-1_6openalex-snapshot
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems
inferredcites →https://doi.org/10.1007/3-540-48224-5_18openalex-snapshot
The RPR 2 Rounding Technique for Semidefinite Programs
inferredcites →https://doi.org/10.1007/978-3-540-27821-4_11openalex-snapshot
On Systems of Linear Equations with Two Variables per Equation
inferredcites →https://doi.org/10.1007/978-3-540-27821-4_14openalex-snapshot
Approximating Max k CSP Using Random Restrictions
inferredcites →https://doi.org/10.1007/978-3-540-31856-9_16openalex-snapshot
More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSP
inferredcites →https://doi.org/10.1007/bf02392825openalex-snapshot
Clique is hard to approximate within n1−ε
inferredcites →https://doi.org/10.1007/pl00009209openalex-snapshot
Parallel Approximation Algorithms by Positive Linear Programming
inferredcites →https://doi.org/10.1007/s004530010035openalex-snapshot
Approximating Satisfiable Satisfiability Problems
inferredcites →https://doi.org/10.1016/0012-365x(81)90023-6openalex-snapshot
How well can a graph be n-colored?
inferredcites →https://doi.org/10.1016/0022-0000(91)90023-xopenalex-snapshot
Optimization, approximation, and complexity classes
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1016/j.jalgor.2004.11.003openalex-snapshot
The RPR2 rounding technique for semidefinite programs
inferredcites →https://doi.org/10.1016/s0022-0000(74)80044-9openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.1109/12.67327openalex-snapshot
Approximation and intractability results for the maximum cut problem and its variants
inferredcites →https://doi.org/10.1109/ccc.1996.507690openalex-snapshot
Zero knowledge and the chromatic number
inferredcites →https://doi.org/10.1109/focs.2004.39openalex-snapshot
Maximizing Quadratic Programs: Extending Grothendieck's Inequality
inferredcites →https://doi.org/10.1109/focs.2004.49openalex-snapshot
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
inferredcites →https://doi.org/10.1109/sfcs.1992.267823openalex-snapshot
Proof verification and hardness of approximation problems
inferredcites →https://doi.org/10.1109/sfcs.1996.548522openalex-snapshot
Clique is hard to approximate within n/sup 1-ε/
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.1112/plms/s2-42.1.230openalex-snapshot
On Computable Numbers, with an Application to the Entscheidungsproblem
inferredcites →https://doi.org/10.1137/0805002openalex-snapshot
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
inferredcites →https://doi.org/10.1137/s0097539795280895openalex-snapshot
A Parallel Repetition Theorem
inferredcites →https://doi.org/10.1137/s0097539796302531openalex-snapshot
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
inferredcites →https://doi.org/10.1137/s0097539797328847openalex-snapshot
Gadgets, Approximation, and Linear Programming
inferredcites →https://doi.org/10.1137/s0097539799349948openalex-snapshot
The Approximability of Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1145/1060590.1060700openalex-snapshot
Every 2-CSP allows nontrivial approximation
inferredcites →https://doi.org/10.1145/185675.306789openalex-snapshot
On the hardness of approximating minimization problems
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/258533.258536openalex-snapshot
Some optimal inapproximability results
inferredcites →https://doi.org/10.1145/274787.274791openalex-snapshot
Approximate graph coloring by semidefinite programming
inferredcites →https://doi.org/10.1145/276698.276869openalex-snapshot
Finding almost-satisfying assignments
inferredcites →https://doi.org/10.1145/278298.278306openalex-snapshot
Proof verification and the hardness of approximation problems
inferredcites →https://doi.org/10.1145/285055.285059openalex-snapshot
A threshold of ln n for approximating set cover
inferredcites →https://doi.org/10.1145/321958.321975openalex-snapshot
P-Complete Approximation Problems
inferredcites →https://doi.org/10.1145/335305.335329openalex-snapshot
A PCP characterization of NP with optimal amortized query complexity
inferredcites →https://doi.org/10.1145/509907.509985openalex-snapshot
Relations between average case complexity and approximation complexity
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.4153/cjm-1982-036-8openalex-snapshot
A Polynomial Algorithm for Constructing a Large Bipartite Subgraph, with an Application to a Satisfiability Problem
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.1007/11523468_77openalex-snapshot
Approximating Max kCSP – Outperforming a Random Assignment with Almost a Linear Factor
inferred← citeshttps://doi.org/10.1007/978-3-031-22318-1_16openalex-snapshot
A Toolbox for Barriers on Interactive Oracle Proofs
inferred← citeshttps://doi.org/10.1007/978-3-540-74208-1_11openalex-snapshot
On the Approximation Resistance of a Random Predicate
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_7openalex-snapshot
Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness
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-15369-3_9openalex-snapshot
Approximating Linear Threshold Predicates
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_17openalex-snapshot
Improved Hardness of Approximating Chromatic Number
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_57openalex-snapshot
The Complexity of Somewhat Approximation Resistant Predicates
inferred← citeshttps://doi.org/10.1007/s00037-008-0256-yopenalex-snapshot
Every 2-csp Allows Nontrivial Approximation
inferred← citeshttps://doi.org/10.1007/s00037-009-0262-8openalex-snapshot
On the Approximation Resistance of a Random Predicate
inferred← citeshttps://doi.org/10.1007/s10559-012-9394-yopenalex-snapshot
Reoptimization of constraint satisfaction problems with approximation resistant predicates
inferred← citeshttps://doi.org/10.1017/cbo9780511666209.008openalex-snapshot
On the efficient approximability of constraint satisfaction problems
inferred← citeshttps://doi.org/10.1109/ccc.2009.29openalex-snapshot
Every Permutation CSP of arity 3 is Approximation Resistant
inferred← citeshttps://doi.org/10.1109/focs.2007.4389531openalex-snapshot
On the Advantage over Random for Maximum Acyclic Subgraph
inferred← citeshttps://doi.org/10.1109/focs.2007.47openalex-snapshot
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem
inferred← citeshttps://doi.org/10.1109/focs.2007.65openalex-snapshot
On the Advantage over Random for Maximum Acyclic Subgraph
inferred← citeshttps://doi.org/10.1145/1060590.1060700openalex-snapshot
Every 2-CSP allows nontrivial approximation
inferred← citeshttps://doi.org/10.1145/2141938.2141940openalex-snapshot
Approximating Linear Threshold Predicates
inferred← citeshttps://doi.org/10.1145/2422436.2422459openalex-snapshot
A characterization of approximation resistance for even k-partite CSPs
inferred← citeshttps://doi.org/10.1145/2462896.2462897openalex-snapshot
On the usefulness of predicates
inferred← citeshttps://doi.org/10.1145/2488608.2488665openalex-snapshot
Approximation resistance from pairwise independent subgroups
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/2591796.2591817openalex-snapshot
A characterization of strong approximation resistance
inferred← citeshttps://doi.org/10.1145/3798129.3800885openalex-snapshot
Optimal Phylogenetic Reconstruction from Sampled Quartets
inferred← citeshttps://doi.org/10.4236/ajor.2013.32025openalex-snapshot
Optimal Approximation Algorithms for Reoptimization of Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1204.5662openalex-snapshot
On the Usefulness of Predicates
inferred← citeshttps://doi.org/10.48550/arxiv.1301.2731openalex-snapshot
A Characterization of Approximation Resistance for Even $k$-Partite CSPs
inferred← citeshttps://doi.org/10.48550/arxiv.1305.5500openalex-snapshot
A Characterization of Approximation Resistance
inferred← citeshttps://doi.org/10.48550/arxiv.1401.6520openalex-snapshot
Approximation Resistance by Disguising Biased Distributions
inferred← citeshttps://doi.org/10.48550/arxiv.1504.00442openalex-snapshot
Refuting Unique Game Conjecture
showing the first 34 of 35 · page through all 35
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.