On the public citation graph

On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique

0 signed · 42 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.1002/rsa.3240030402openalex-snapshot
Large Cliques Elude the Metropolis Process
inferredcites →https://doi.org/10.1007/978-3-642-03685-9_31openalex-snapshot
Random Tensors and Planted Cliques
inferredcites →https://doi.org/10.1007/s00037-001-8192-0openalex-snapshot
Complexity of Positivstellensatz proofs for the knapsack
inferredcites →https://doi.org/10.1007/s10208-014-9215-yopenalex-snapshot
Finding Hidden Cliques of Size $$\sqrt{N/e}$$ N / e in Nearly Linear Time
inferredcites →https://doi.org/10.1016/0166-218x(94)00103-kopenalex-snapshot
Expected complexity of graph partitioning problems
inferredcites →https://doi.org/10.1016/s0304-3975(00)00157-2openalex-snapshot
Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity
inferredcites →https://doi.org/10.1017/s0305004100053056openalex-snapshot
Cliques in random graphs
inferredcites →https://doi.org/10.1017/s096354831300045xopenalex-snapshot
Finding Hidden Cliques in Linear Time with High Probability
inferredcites →https://doi.org/10.1109/focs.2008.74openalex-snapshot
Linear Level Lasserre Lower Bounds for Certain k-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.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/focs.2012.58openalex-snapshot
Faster SDP Hierarchy Solvers for Local Rounding Algorithms
inferredcites →https://doi.org/10.1137/1.9781611973068.79openalex-snapshot
How hard is it to approximate the best Nash equilibrium?
inferredcites →https://doi.org/10.1137/s009753970240118xopenalex-snapshot
The Probable Value of the Lovász--Schrijver Relaxations for Maximum Independent Set
inferredcites →https://doi.org/10.1137/s1052623400366802openalex-snapshot
Global Optimization with Polynomials and the Problem of Moments
inferredcites →https://doi.org/10.1145/1007352.1007355openalex-snapshot
Expander flows, geometric embeddings and graph partitioning
inferredcites →https://doi.org/10.1145/1250790.1250863openalex-snapshot
Testing k-wise and almost k-wise independence
inferredcites →https://doi.org/10.1145/1536414.1536457openalex-snapshot
CSP gaps and reductions in the lasserre hierarchy
inferredcites →https://doi.org/10.1145/1806689.1806715openalex-snapshot
Public-key cryptography from different assumptions
inferredcites →https://doi.org/10.1145/2213977.2214006openalex-snapshot
Hypercontractivity, sum-of-squares proofs, and their applications
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/2432622.2432625openalex-snapshot
Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization
inferredcites →https://doi.org/10.1145/2488608.2488668openalex-snapshot
Majority is stablest
inferredcites →https://doi.org/10.1145/2591796.2591886openalex-snapshot
Rounding sum-of-squares relaxations
inferredcites →https://doi.org/10.1145/2746539.2746599openalex-snapshot
Lower Bounds on the Size of Semidefinite Programming Relaxations
inferredcites →https://doi.org/10.1145/2746539.2746605openalex-snapshot
Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method
inferredcites →https://doi.org/10.1145/2746539.2746625openalex-snapshot
Sum of Squares Lower Bounds from Pairwise Independence
inferredcites →https://doi.org/10.46298/dmtcs.2802openalex-snapshot
Finding hidden cliques in linear time
inferredcites →https://doi.org/10.5555/2095116.2095150openalex-snapshot
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
inferredcites →https://doi.org/10.5555/2627817.2627928openalex-snapshot
Approximability and proof complexity

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-031-48615-9_11openalex-snapshot
Cryptography from Planted Graphs: Security with Logarithmic-Size Messages
inferred← citeshttps://doi.org/10.1080/10586458.2024.2400182openalex-snapshot
Spectral Pseudorandomness and the Road to Improved Clique Number Bounds for Paley Graphs
inferred← citeshttps://doi.org/10.1090/pspum/111/02047openalex-snapshot
Sums of squares, spectrahedra, and Bernd
inferred← citeshttps://doi.org/10.1109/lics.2019.8785792openalex-snapshot
On the Power of Symmetric Linear Programs
inferred← citeshttps://doi.org/10.1109/tit.2018.2870853openalex-snapshot
A Statistical Model for Motifs Detection
inferred← citeshttps://doi.org/10.1109/tit.2024.3382228openalex-snapshot
Planted Bipartite Graph Detection
inferred← citeshttps://doi.org/10.1109/tsipn.2022.3211208openalex-snapshot
Inferring Hidden Structures in Random Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611974782.86openalex-snapshot
ETH Hardness for Densest- k -Subgraph with Perfect Completeness
inferred← citeshttps://doi.org/10.1137/24m1680489openalex-snapshot
Finding Planted Cliques Using Gradient Descent
inferred← citeshttps://doi.org/10.1145/3293611.3331599openalex-snapshot
Broadcast Congested Clique
inferred← citeshttps://doi.org/10.1145/3357713.3384319openalex-snapshot
Lifting sum-of-squares lower bounds: degree-2 to degree-4
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.