Pages that link to "Item:Q4977967"
From MaRDI portal
The following pages link to Sum of squares lower bounds for refuting any CSP (Q4977967):
Displayed 26 items.
- Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
- Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio (Q2103494) (← links)
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials (Q2143214) (← links)
- Computational barriers to estimation from low-degree polynomials (Q2149001) (← links)
- Breaking symmetries to rescue sum of squares in the case of makespan scheduling (Q2196315) (← links)
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) (Q2693051) (← links)
- (Q4568111) (← links)
- The Lov\'asz Theta Function for Random Regular Graphs and Community Detection in the Hard Regime (Q5002631) (← links)
- (Q5002634) (← links)
- (Q5005186) (← links)
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
- (Q5090427) (← links)
- (Q5090440) (← links)
- (Q5091238) (← links)
- Sherali-adams strikes back (Q5091758) (← links)
- Constructing concrete hard instances of the maximum independent set problem (Q5149679) (← links)
- (Q5158503) (← links)
- The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime (Q5232321) (← links)
- Max-3-Lin over non-abelian groups with universal factor graphs (Q6053470) (← links)
- (Q6062142) (← links)
- Sum of Squares Bounds for the Empty Integral Hull Problem (Q6081967) (← links)
- Algorithmic obstructions in the random number partitioning problem (Q6139686) (← links)
- Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN (Q6186715) (← links)
- The Spectrum of the Grigoriev–Laurent Pseudomoments (Q6187076) (← links)
- Indistinguishability obfuscation (Q6198645) (← links)