On the public citation graph
Approximating Max kCSP – Outperforming a Random Assignment with Almost a Linear Factor
0 signed · 34 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.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/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/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.1109/focs.2004.39openalex-snapshot
Maximizing Quadratic Programs: Extending Grothendieck's Inequality
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/s0097539796302531openalex-snapshot
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
inferredcites →https://doi.org/10.1137/s0097539796309326openalex-snapshot
Derandomizing Approximation Algorithms Based on Semidefinite Programming
inferredcites →https://doi.org/10.1145/335305.335329openalex-snapshot
A PCP characterization of NP with optimal amortized query complexity
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.20226openalex-snapshot
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP
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-32512-0_22openalex-snapshot
Approximation Algorithm for Non-boolean MAX k-CSP
inferred← citeshttps://doi.org/10.1109/ccc.2008.20openalex-snapshot
Approximation Resistant Predicates from Pairwise Independence
inferred← citeshttps://doi.org/10.1109/ccc.2011.15openalex-snapshot
Approximation Algorithms for QMA-Complete Problems
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.1137/1.9781611974331.ch105openalex-snapshot
Integrality Gaps and Approximation Algorithms for Dispersers and Bipartite Expanders
inferred← citeshttps://doi.org/10.1145/1132516.1132519openalex-snapshot
Gowers uniformity, influence of variables, and PCPs
inferred← citeshttps://doi.org/10.1145/1250790.1250818openalex-snapshot
Balanced max 2-sat might not be the hardest
inferred← citeshttps://doi.org/10.1145/1250790.1250864openalex-snapshot
Low-degree tests at large distances
inferred← citeshttps://doi.org/10.1145/1541885.1541893openalex-snapshot
Near-optimal algorithms for maximum constraint satisfaction problems
inferred← citeshttps://doi.org/10.1145/2488608.2488665openalex-snapshot
Approximation resistance from pairwise independent subgroups
inferred← citeshttps://doi.org/10.1145/2873054openalex-snapshot
Approximation Resistance from Pairwise-Independent Subgroups
inferred← citeshttps://doi.org/10.48550/arxiv.1301.2632openalex-snapshot
Approximation, Proof Systems, and Correlations in a Quantum World
inferred← citeshttps://doi.org/10.48550/arxiv.1511.06558openalex-snapshot
Near-Optimal UGC-hardness of Approximating Max k-CSP_R
inferred← citeshttps://doi.org/10.5555/1283383.1283391openalex-snapshot
Near-optimal algorithms for maximum constraint satisfaction problems
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.