On the public citation graph

Making the Long Code Shorter

0 signed · 77 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.1007/978-1-4614-0769-0_6openalex-snapshot
Convex Relaxations and Integrality Gaps
inferredcites →https://doi.org/10.1007/978-1-4757-3216-0_17openalex-snapshot
Squared Functional Systems and Optimization Problems
inferredcites →https://doi.org/10.1007/bf01074929openalex-snapshot
An approach to obtaining global extremums in polynomial mathematical programming problems
inferredcites →https://doi.org/10.1109/ccc.2002.1004334openalex-snapshot
On the power of unique 2-prover 1-round games
inferredcites →https://doi.org/10.1109/ccc.2010.20openalex-snapshot
Spectral Algorithms for Unique Games
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/focs.2009.37openalex-snapshot
SDP Integrality Gaps with Local ell_1-Embeddability
inferredcites →https://doi.org/10.1109/focs.2009.73openalex-snapshot
Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES
inferredcites →https://doi.org/10.1109/focs.2010.54openalex-snapshot
Optimal Testing of Reed-Muller Codes
inferredcites →https://doi.org/10.1109/focs.2010.59openalex-snapshot
Subexponential Algorithms for Unique Games and Related Problems
inferredcites →https://doi.org/10.1109/focs.2011.95openalex-snapshot
Rounding Semidefinite Programming Hierarchies via Global Correlation
inferredcites →https://doi.org/10.1109/sfcs.2005.74openalex-snapshot
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into \ell 1
inferredcites →https://doi.org/10.1109/tit.2005.856958openalex-snapshot
Testing Reed–Muller Codes
inferredcites →https://doi.org/10.1137/0403036openalex-snapshot
A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
inferredcites →https://doi.org/10.1137/1.9781611973082.125openalex-snapshot
The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number
inferredcites →https://doi.org/10.1137/s0097539705447372openalex-snapshot
Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
inferredcites →https://doi.org/10.1137/s1052623400366802openalex-snapshot
Global Optimization with Polynomials and the Problem of Moments
inferredcites →https://doi.org/10.1145/1109557.1109569openalex-snapshot
Approximating unique games
inferredcites →https://doi.org/10.1145/1132516.1132547openalex-snapshot
Near-optimal algorithms for unique games
inferredcites →https://doi.org/10.1145/1374376.1374380openalex-snapshot
Unique games on expanding constraint graphs are easy
inferredcites →https://doi.org/10.1145/1806689.1806749openalex-snapshot
Pseudorandom generators for polynomial threshold functions
inferredcites →https://doi.org/10.1145/2775105openalex-snapshot
Subexponential Algorithms for Unique Games and Related Problems
inferredcites →https://doi.org/10.1145/509907.510017openalex-snapshot
On the power of unique 2-prover 1-round games
inferredcites →https://doi.org/10.1515/9781400869312-013openalex-snapshot
A Lower Bound for the Smallest Eigenvalue of the Laplacian
inferredcites →https://doi.org/10.4007/annals.2010.171.295openalex-snapshot
Noise stability of functions with low influences: Invariance and optimality
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2020.31openalex-snapshot
Making the long code shorter, with applications to the Unique Games Conjecture
inferredcites →https://doi.org/10.48550/arxiv.math/0503503openalex-snapshot
Noise stability of functions with low influences: invariance and optimality
inferredcites →https://doi.org/10.5555/1109557.1109569openalex-snapshot
Approximating unique games
inferredcites →https://doi.org/10.7907/2k6y-ch43.openalex-snapshot
Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_54openalex-snapshot
A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codes
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_46openalex-snapshot
Absolutely Sound Testing of Lifted Codes
inferred← citeshttps://doi.org/10.1007/s00493-019-3847-0openalex-snapshot
High Order Random Walks: Beyond Spectral Gap
inferred← citeshttps://doi.org/10.1007/s11856-015-1231-3openalex-snapshot
PCPs via the low-degree long code and hardness for constrained hypergraph coloring
inferred← citeshttps://doi.org/10.1109/focs.2012.10openalex-snapshot
Approximation Limits of Linear Programs (Beyond Hierarchies)
inferred← citeshttps://doi.org/10.1109/focs.2013.44openalex-snapshot
PCPs via Low-Degree Long Code and Hardness for Constrained Hypergraph Coloring
inferred← citeshttps://doi.org/10.1109/focs.2014.30openalex-snapshot
Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with exp(log^{Omega(1)} n) Colors
inferred← citeshttps://doi.org/10.1109/focs.2019.00026openalex-snapshot
Reed-Muller Codes Polarize
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00069openalex-snapshot
Explicit Lower Bounds Against Ω(n)-Rounds of Sum-of-Squares
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00020openalex-snapshot
A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels
inferred← citeshttps://doi.org/10.1109/tit.2015.2462817openalex-snapshot
Reed–Muller Codes for Random Erasures and Errors
inferred← citeshttps://doi.org/10.1109/tit.2018.2863713openalex-snapshot
Robust Multiplication-Based Tests for Reed–Muller Codes
inferred← citeshttps://doi.org/10.1109/tit.2020.3023487openalex-snapshot
Reed-Muller Codes Polarize
inferred← citeshttps://doi.org/10.1137/1.9781611973730.85openalex-snapshot
Decomposing a Graph Into Expanding Subgraphs
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.1137/1.9781611974782.121openalex-snapshot
Random Walks and Evolving Sets: Faster Convergences and Limitations
inferred← citeshttps://doi.org/10.1145/2488608.2488610openalex-snapshot
A PRG for lipschitz functions of polynomials with applications to sparsest cut
inferred← citeshttps://doi.org/10.1145/2554797.2554807openalex-snapshot
Locally testable codes and cayley graphs
inferred← citeshttps://doi.org/10.1145/2556663.2556678openalex-snapshot
Guest column
inferred← citeshttps://doi.org/10.1145/2591796.2591882openalex-snapshot
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes
inferred← citeshttps://doi.org/10.1145/2591796.2591886openalex-snapshot
Rounding sum-of-squares relaxations
inferred← citeshttps://doi.org/10.1145/2629614openalex-snapshot
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ 1
inferred← citeshttps://doi.org/10.1145/2746539.2746575openalex-snapshot
Reed-Muller Codes for Random Erasures and Errors
inferred← citeshttps://doi.org/10.1145/2775105openalex-snapshot
Subexponential Algorithms for Unique Games and Related Problems
inferred← citeshttps://doi.org/10.1145/2897518.2897531openalex-snapshot
Candidate hard unique game
inferred← citeshttps://doi.org/10.1145/3406325.3451099openalex-snapshot
Playing unique games on certified small-set expanders
inferred← citeshttps://doi.org/10.1145/3406325.3451129openalex-snapshot
Support of closed walks and second eigenvalue multiplicity of graphs
inferred← citeshttps://doi.org/10.1145/3519935.3520040openalex-snapshot
Hypercontractivity on high dimensional expanders
inferred← citeshttps://doi.org/10.1145/3717823.3718187openalex-snapshot
Hypercontractivity on HDX II: Symmetrization and 𝑞-Norms
inferred← citeshttps://doi.org/10.1201/9781420010749-23openalex-snapshot
Hardness of Approximation
inferred← citeshttps://doi.org/10.1287/moor.2014.0694openalex-snapshot
Approximation Limits of Linear Programs (Beyond Hierarchies)
inferred← citeshttps://doi.org/10.4086/cjtcs.2015.003openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2013.v009a025openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2015.v011a012openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2020.v016a016openalex-snapshot
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2015.275openalex-snapshot
Derandomized Graph Product Results Using the Low Degree Long Code
inferred← citeshttps://doi.org/10.48550/arxiv.1204.0957openalex-snapshot
Approximation Limits of Linear Programs (Beyond Hierarchies)
inferred← citeshttps://doi.org/10.48550/arxiv.1404.5236openalex-snapshot
Sum-of-squares proofs and the quest toward optimal algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1408.0262openalex-snapshot
Reducing uniformity in Khot-Saket hypergraph coloring hardness reductions
inferred← citeshttps://doi.org/10.48550/arxiv.1504.03923openalex-snapshot
$2^{(\log N)^{1/10-o(1)}}$ Hardness for Hypergraph Coloring
inferred← citeshttps://doi.org/10.48550/arxiv.1507.05950openalex-snapshot
On the Worst-Case Approximability of Sparse PCA
inferred← citeshttps://doi.org/10.48550/arxiv.1804.08155openalex-snapshot
Boolean functions on high-dimensional expanders
inferred← citeshttps://doi.org/10.48550/arxiv.2007.12819openalex-snapshot
Support of Closed Walks and Second Eigenvalue Multiplicity of the Normalized Adjacency Matrix
inferred← citeshttps://doi.org/10.48550/arxiv.2103.08743openalex-snapshot
Strong Parallel Repetition for Unique Games on Small Set Expanders
inferred← citeshttps://doi.org/10.5070/c6.68665openalex-snapshot
Complexity measures on the symmetric group and beyond
inferred← citeshttps://doi.org/10.5555/2627817.2627928openalex-snapshot
Approximability and proof complexity
inferred← citeshttps://doi.org/10.5555/2722129.2722214openalex-snapshot
Decomposing a graph into expanding subgraphs
inferred← citeshttps://doi.org/10.5555/3310435.3310563openalex-snapshot
Analyzing boolean functions on the biased hypercube via higher-dimensional agreement tests
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.