Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
Abstract
MSC codes
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
Information & Authors
Information
Published In
Copyright
History
MSC codes
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet caseACM Transactions on Computation Theory, Vol. 16, No. 4 | 11 November 2024
- Reinforcement learning assisted recursive QAOAEPJ Quantum Technology, Vol. 11, No. 1 | 17 January 2024
- Neural spectrahedra and semidefinite lifts: global convex optimization of degree-two polynomial activation neural networks in polynomial-timeMathematical Programming, Vol. 5 | 8 November 2024
- Analytical results for the quantum alternating operator ansatz with Grover mixerPhysical Review A, Vol. 110, No. 5 | 6 November 2024
- Expanding the reach of quantum optimization with fermionic embeddingsQuantum, Vol. 8 | 28 August 2024
- Bounded Degree Nonnegative Counting CSPACM Transactions on Computation Theory, Vol. 16, No. 2 | 14 March 2024
- Constrained Submodular Maximization via New Bounds for DR-Submodular FunctionsProceedings of the 56th Annual ACM Symposium on Theory of Computing | 11 June 2024
- Swap Cosystolic ExpansionProceedings of the 56th Annual ACM Symposium on Theory of Computing | 11 June 2024
- A review on Quantum Approximate Optimization Algorithm and its variantsPhysics Reports, Vol. 1068 | 1 Jun 2024
- An Expressive Ansatz for Low-Depth Quantum Approximate OptimisationQuantum Science and Technology | 18 January 2024
- Lower Bounds of Functions on Finite Abelian GroupsComputing and Combinatorics | 9 December 2023
- An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max CutACM Journal of Experimental Algorithmics, Vol. 28 | 11 August 2023
- Optimal Inapproximability with Universal Factor GraphsACM Transactions on Algorithms, Vol. 27 | 15 December 2023
- Data-driven quantum approximate optimization algorithm for power systemsCommunications Engineering, Vol. 2, No. 1 | 9 March 2023
- An Improved Approximation Algorithm for Quantum Max-Cut on Triangle-Free GraphsQuantum, Vol. 7 | 9 November 2023
- On Lifting Integrality Gaps to SSEH Hardness for Globally Constrained CSPs2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) | 6 Nov 2023
- Separating MAX 2-AND, MAX DI-CUT and MAX CUT2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) | 6 Nov 2023
- Triplet Reconstruction and all other Phylogenetic CSPs are Approximation Resistant2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) | 6 Nov 2023
- A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysisJournal of Global Optimization, Vol. 87, No. 2-4 | 15 June 2022
- Numerical Evidence for Exponential Speed-Up of QAOA over Unstructured Search for Approximate Constrained Optimization2023 IEEE International Conference on Quantum Computing and Engineering (QCE) | 17 Sep 2023
- Max-Cut via Kuramoto-Type OscillatorsSIAM Journal on Applied Dynamical Systems, Vol. 22, No. 2 | 31 May 2023
- Bridging Classical and Quantum with SDP initialized warm-starts for QAOAACM Transactions on Quantum Computing, Vol. 4, No. 2 | 24 February 2023
- Noise Stability on the Boolean Hypercube via a Renormalized Brownian MotionProceedings of the 55th Annual ACM Symposium on Theory of Computing | 2 June 2023
- Streaming Euclidean Max-Cut: Dimension vs Data ReductionProceedings of the 55th Annual ACM Symposium on Theory of Computing | 2 June 2023
- An Optimal “It Ain’t Over Till It’s Over” TheoremProceedings of the 55th Annual ACM Symposium on Theory of Computing | 2 June 2023
- Stochastic Neuromorphic Circuits for Solving MAXCUT2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS) | 1 May 2023
- Synergies Between Operations Research and Quantum Information ScienceINFORMS Journal on Computing, Vol. 35, No. 2 | 1 Mar 2023
- Parameterized complexity of multi-node hubsJournal of Computer and System Sciences, Vol. 131 | 1 Feb 2023
- Total Completion Time Scheduling Under ScenariosApproximation and Online Algorithms | 22 December 2023
- A Brief Overview of Randomized AlgorithmsIOT with Smart Systems | 31 August 2023
- Analytical framework for quantum alternating operator ansätzeQuantum Science and Technology, Vol. 8, No. 1 | 7 December 2022
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian SolvingSIAM Journal on Computing, Vol. 51, No. 6 | 20 December 2022
- Quantum Algorithm Implementations for BeginnersACM Transactions on Quantum Computing, Vol. 3, No. 4 | 7 July 2022
- On Monotonicity Testing and the 2-to-2 Games Conjecture14 December 2022
- Graph neural network initialisation of quantum approximate optimisationQuantum, Vol. 6 | 17 November 2022
- Disordered systems insights on computational hardnessJournal of Statistical Mechanics: Theory and Experiment, Vol. 2022, No. 11 | 24 November 2022
- Sticky Brownian Rounding and its Applications to Constraint Satisfaction ProblemsACM Transactions on Algorithms, Vol. 18, No. 4 | 10 October 2022
- Quantum Approximate Optimization Algorithm-Enabled DER Disturbance Analysis of Networked Microgrids2022 IEEE Energy Conversion Congress and Exposition (ECCE) | 9 Oct 2022
- Evaluation of QAOA based on the approximation ratio of individual samplesQuantum Science and Technology, Vol. 7, No. 4 | 5 August 2022
- Twisted hybrid algorithms for combinatorial optimizationQuantum Science and Technology, Vol. 7, No. 4 | 12 August 2022
- Fitting Metrics and Ultrametrics with Minimum Disagreements2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) | 1 Oct 2022
- The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) | 1 Oct 2022
- Variational quantum optimization with multibasis encodingsPhysical Review Research, Vol. 4, No. 3 | 22 August 2022
- Probabilistic view of voting, paradoxes, and manipulationBulletin of the American Mathematical Society, Vol. 59, No. 3 | 2 December 2021
- MAX-CUT on Samplings of Dense Graphs2022 19th International Joint Conference on Computer Science and Software Engineering (JCSSE) | 22 Jun 2022
- Dynamics Analysis of Microgrids Integrated with EV Charging Stations based on Quantum Approximate Optimization Algorithm2022 IEEE Transportation Electrification Conference & Expo (ITEC) | 15 Jun 2022
- On approximability of satisfiable k -CSPs: IProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 10 June 2022
- A characterization of approximability for biased CSPsProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 10 June 2022
- Selection and Optimization of Hyperparameters in Warm-Started Quantum Optimization for the MaxCut ProblemElectronics, Vol. 11, No. 7 | 25 March 2022
- Hybrid quantum-classical algorithms for approximate graph coloringQuantum, Vol. 6 | 30 March 2022
- An Efficient Riemannian Gradient Based Algorithm for Max-Cut ProblemsIEEE Transactions on Circuits and Systems II: Express Briefs, Vol. 69, No. 3 | 1 Mar 2022
- Constrained Assortment Optimization Under the Paired Combinatorial Logit ModelOperations Research, Vol. 70, No. 2 | 1 Mar 2022
- An Invariance Principle for the Multi-slice, with Applications2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) | 1 Feb 2022
- On statistical inference when fixed points of belief propagation are unstable2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) | 1 Feb 2022
- Recent Theoretical Advances in Non-Convex OptimizationHigh-Dimensional Optimization and Probability | 5 April 2022
- Low Correlation Noise Stability of Symmetric SetsJournal of Theoretical Probability, Vol. 34, No. 4 | 24 August 2020
- Qualifying quantum approaches for hard industrial optimization problems. A case study in the field of smart-charging of electric vehiclesEPJ Quantum Technology, Vol. 8, No. 1 | 17 May 2021
- Classical symmetries and the Quantum Approximate Optimization AlgorithmQuantum Information Processing, Vol. 20, No. 11 | 26 October 2021
- Training Variational Quantum Algorithms Is NP-HardPhysical Review Letters, Vol. 127, No. 12 | 17 September 2021
- Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower BoundsAlgorithmica, Vol. 83, No. 7 | 2 May 2021
- Warm-starting quantum optimizationQuantum, Vol. 5 | 17 June 2021
- Playing unique games on certified small-set expandersProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 15 June 2021
- A quasipolynomial (2 + ε )-approximation for planar sparsest cutProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 15 June 2021
- The Structure of Gaussian Minimal BubblesThe Journal of Geometric Analysis, Vol. 31, No. 6 | 14 October 2020
- Computing the Largest Bond and the Maximum Connected Cut of a GraphAlgorithmica, Vol. 83, No. 5 | 8 January 2021
- Efficient Encoding of the Weighted MAX $$k$$-CUT on a Quantum Computer Using QAOASN Computer Science, Vol. 2, No. 2 | 13 February 2021
- Fundamental Domains for Symmetric Optimization: Construction and SearchSIAM Journal on Optimization, Vol. 31, No. 3 | 15 July 2021
- Probability and StatisticsLandscape of 21st Century Mathematics | 26 July 2021
- Hypercontractivity via Tensor CalculusComputing and Combinatorics | 20 October 2021
- Three candidate plurality is stablest for small correlationsForum of Mathematics, Sigma, Vol. 9 | 28 September 2021
- Quantum approximate optimization and k-means algorithms for data clusteringJournal of Physics: Conference Series, Vol. 1719, No. 1 | 1 Jan 2021
- Performance of Domain-Wall Encoding for Quantum AnnealingIEEE Transactions on Quantum Engineering, Vol. 2 | 1 Jan 2021
- Classically Optimal Variational Quantum AlgorithmsIEEE Transactions on Quantum Engineering, Vol. 2 | 1 Jan 2021
- A tight $$\sqrt{2}$$-approximation for linear 3-cutMathematical Programming, Vol. 184, No. 1-2 | 29 July 2019
- Towards a Proof of the Fourier–Entropy Conjecture?2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) | 1 Nov 2020
- Optimal Streaming Approximations for all Boolean Max-2CSPs and Max-ksat2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) | 1 Nov 2020
- To quantum or not to quantum: towards algorithm selection in near-term quantum optimizationQuantum Science and Technology, Vol. 5, No. 4 | 13 October 2020
- Investigating quantum approximate optimization algorithms under bang-bang protocolsPhysical Review Research, Vol. 2, No. 3 | 14 September 2020
- Clustering Improves the Goemans–Williamson Approximation for the Max-Cut ProblemComputation, Vol. 8, No. 3 | 26 August 2020
- Towards a Proof of the Fourier-Entropy Conjecture?Geometric and Functional Analysis, Vol. 30, No. 4 | 5 September 2020
- Coreness of cooperative games with truncated submodular profit functionsTheoretical Computer Science, Vol. 822 | 1 Jun 2020
- Approximation algorithms for connected maximum cut and related problemsTheoretical Computer Science, Vol. 814 | 1 Apr 2020
- Quantum SDP-Solvers: Better upper and lower boundsQuantum, Vol. 4 | 14 February 2020
- Half-Spaces with Influential VariableTheory of Probability & Its Applications, Vol. 65, No. 1 | 22 April 2020
- A periodic isoperimetric problem related to the unique games conjectureRandom Structures & Algorithms, Vol. 56, No. 1 | 24 July 2019
- Approximation Algorithms for Balancing Signed GraphsAlgorithmic Aspects in Information and Management | 9 August 2020
- Halfspaces with influential variableТеория вероятностей и ее применения, Vol. 65, No. 1 | 22 January 2020
- Noise Sensitivity on the p -Biased Hypercube2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) | 1 Nov 2019
- Domain wall encoding of discrete variables for quantum annealing and QAOAQuantum Science and Technology, Vol. 4, No. 4 | 6 August 2019
- Connections between structured tight frames and sum-of-squares optimizationWavelets and Sparsity XVIII | 9 Sep 2019
- Hypergraph cuts above the averageIsrael Journal of Mathematics, Vol. 233, No. 1 | 9 July 2019
- Constrained Submodular Maximization via a Nonsymmetric TechniqueMathematics of Operations Research, Vol. 44, No. 3 | 1 Aug 2019
- Online Submodular Maximization with PreemptionACM Transactions on Algorithms, Vol. 15, No. 3 | 7 June 2019
- Sum-of-Squares Optimization and the Sparsity Structure of Equiangular Tight Frames2019 13th International conference on Sampling Theory and Applications (SampTA) | 1 Jul 2019
- On the approximation resistance of balanced linear threshold functionsProceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 23 June 2019
- Complexity results on planar multifacility location problems with forbidden regionsMathematical Methods of Operations Research, Vol. 89, No. 3 | 25 May 2019
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator AnsatzAlgorithms, Vol. 12, No. 2 | 12 February 2019
- Proof Complexity Meets AlgebraACM Transactions on Computational Logic, Vol. 20, No. 1 | 20 December 2018
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPsSIAM Journal on Computing, Vol. 48, No. 6 | 26 November 2019
- An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing NumberCombinatorial Algorithms | 10 July 2019
- Chance-Constrained Submodular Knapsack ProblemComputing and Combinatorics | 21 July 2019
- Affine reductions for LPs and SDPsMathematical Programming, Vol. 173, No. 1-2 | 16 January 2018
- $$(k,n-k)$$ ( k , n - k ) -Max-Cut: An $$\mathcal{O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial KernelAlgorithmica, Vol. 80, No. 12 | 20 February 2018
- A priori TSP in the scenario modelDiscrete Applied Mathematics, Vol. 250 | 1 Dec 2018
- Approximating graph-constrained max-cutMathematical Programming, Vol. 172, No. 1-2 | 6 May 2017
- Towards a characterization of constant-factor approximable finite-valued CSPsJournal of Computer and System Sciences, Vol. 97 | 1 Nov 2018
- Approximating max-cut under graph-MSO constraintsOperations Research Letters, Vol. 46, No. 6 | 1 Nov 2018
- Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) | 1 Oct 2018
- Deterministic Algorithms for Submodular Maximization ProblemsACM Transactions on Algorithms, Vol. 14, No. 3 | 16 June 2018
- Complexity and Approximation of Finding the Longest Vector SumComputational Mathematics and Mathematical Physics, Vol. 58, No. 6 | 9 July 2018
- Gaussian noise sensitivity and Fourier tailsIsrael Journal of Mathematics, Vol. 225, No. 1 | 21 March 2018
- Simple Approximation Algorithms for Balanced MAX 2SATAlgorithmica, Vol. 80, No. 3 | 21 April 2017
- On the Maximum Crossing NumberCombinatorial Algorithms | 17 April 2018
- Complexity and Approximation of the Longest Vector Sum ProblemApproximation and Online Algorithms | 31 March 2018
- Inapproximability of Maximum Biclique Problems, Minimum k-Cut and Densest At-Least-k-Subgraph from the Small Set Expansion HypothesisAlgorithms, Vol. 11, No. 1 | 17 January 2018
- Minimizing worst-case and average-case makespan over scenariosJournal of Scheduling, Vol. 20, No. 6 | 17 June 2016
- Inapproximability Ratios for Crossing NumberElectronic Notes in Discrete Mathematics, Vol. 62 | 1 Nov 2017
- Inversion detection using PacBio long reads2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM) | 1 Nov 2017
- Quantum SDP-Solvers: Better Upper and Lower Bounds2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) | 1 Oct 2017
- Minimum Cell Connection in Line Segment ArrangementsInternational Journal of Computational Geometry & Applications, Vol. 27, No. 03 | 29 January 2018
- On the Approximability of Digraph OrderingAlgorithmica, Vol. 78, No. 4 | 18 October 2016
- Comparing Apples and Oranges: Query Trade-off in Submodular MaximizationMathematics of Operations Research, Vol. 42, No. 2 | 1 May 2017
- Sparse approximation is provably hard under coherent dictionariesJournal of Computer and System Sciences, Vol. 84 | 1 Mar 2017
- Better Balance by Being BiasedACM Transactions on Algorithms, Vol. 13, No. 1 | 10 October 2016
- Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long CodesSIAM Journal on Computing, Vol. 46, No. 1 | 22 February 2017
- A priori TSP in the Scenario ModelApproximation and Online Algorithms | 7 January 2017
- Complexity and Algorithms for Finding a Subset of Vectors with the Longest SumComputing and Combinatorics | 1 July 2017
- The Complexity of Approximation Reoptimization Algorithms for Discrete OptimizationOptimization Methods and Applications | 7 December 2017
- Fast Distributed Approximation for Max-CutAlgorithms for Sensor Systems | 31 December 2017
- Tightness of correlation inequalities with no quantum violationPhysical Review A, Vol. 95, No. 1 | 27 January 2017
- Complexity of Approximating CSP with Balance / Hard ConstraintsTheory of Computing Systems, Vol. 59, No. 1 | 25 June 2015
- Candidate hard unique gameProceedings of the forty-eighth annual ACM symposium on Theory of Computing | 19 June 2016
- Standard simplices and pluralities are not the most noise stableIsrael Journal of Mathematics, Vol. 213, No. 1 | 15 April 2016
- Bypassing UGC from Some Optimal Geometric Inapproximability ResultsACM Transactions on Algorithms, Vol. 12, No. 1 | 8 February 2016
- Generalized xor games with d outcomes and the task of nonlocal computationPhysical Review A, Vol. 93, No. 2 | 29 February 2016
- Robustly Solvable Constraint Satisfaction ProblemsSIAM Journal on Computing, Vol. 45, No. 4 | 30 August 2016
- Nonnegative Weighted #CSP: An Effective Complexity DichotomySIAM Journal on Computing, Vol. 45, No. 6 | 20 December 2016
- Max-Cut Under Graph ConstraintsInteger Programming and Combinatorial Optimization | 25 May 2016
- Simple Approximation Algorithms for Balanced MAX 2SATLATIN 2016: Theoretical Informatics | 22 March 2016
- $$(k,n-k)$$ ( k , n - k ) -Max-Cut: An $${\mathcal O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial KernelLATIN 2016: Theoretical Informatics | 22 March 2016
- Improved Approximation for Orienting Mixed GraphsAlgorithmica, Vol. 74, No. 1 | 27 August 2014
- Improved approximating $2$-CatSP for $\sigma\geq 0.50$ with an unbalanced rounding matrixJournal of Industrial and Management Optimization, Vol. 12, No. 4 | 1 Jan 2016
- Subexponential Algorithms for Unique Games and Related ProblemsJournal of the ACM, Vol. 62, No. 5 | 2 November 2015
- Beyond the Central Limit theorem: Asymptotic Expansions and Pseudorandomness for Combinatorial Sums2015 IEEE 56th Annual Symposium on Foundations of Computer Science | 1 Oct 2015
- Tight Hardness of the Non-commutative Grothendieck Problem2015 IEEE 56th Annual Symposium on Foundations of Computer Science | 1 Oct 2015
- PCPs via the low-degree long code and hardness for constrained hypergraph coloringIsrael Journal of Mathematics, Vol. 209, No. 2 | 3 November 2015
- Approximation Limits of Linear Programs (Beyond Hierarchies)Mathematics of Operations Research, Vol. 40, No. 3 | 1 Aug 2015
- Hardness of Graph Pricing Through Generalized Max-DicutProceedings of the forty-seventh annual ACM symposium on Theory of Computing | 14 June 2015
- Inapproximability of Combinatorial Problems via Small LPs and SDPsProceedings of the forty-seventh annual ACM symposium on Theory of Computing | 14 June 2015
- Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic GroupsACM Transactions on Computation Theory, Vol. 7, No. 2 | 11 May 2015
- Exponential Lower Bounds for Polytopes in Combinatorial OptimizationJournal of the ACM, Vol. 62, No. 2 | 6 May 2015
- Oblivious Algorithms for the Maximum Directed Cut ProblemAlgorithmica, Vol. 71, No. 2 | 29 June 2013
- Sketching Cuts in Graphs and HypergraphsProceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 11 January 2015
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular MaximizationSIAM Journal on Computing, Vol. 44, No. 5 | 27 October 2015
- Making the Long Code ShorterSIAM Journal on Computing, Vol. 44, No. 5 | 27 October 2015
- Approximating CSPs Using LP RelaxationAutomata, Languages, and Programming | 20 June 2015
- Approximation Algorithms for Connected Maximum Cut and Related ProblemsAlgorithms - ESA 2015 | 12 November 2015
- On the Approximability of Digraph OrderingAlgorithms - ESA 2015 | 12 November 2015
- Speeding up a memetic algorithm for the max-bisection problemNumerical Algebra, Control & Optimization, Vol. 5, No. 2 | 1 Jan 2015
- Beyond Max-Cut: λ-extendible properties parameterized above the Poljak–Turzík boundJournal of Computer and System Sciences, Vol. 80, No. 7 | 1 Nov 2014
- Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptopeJournal of Combinatorial Theory, Series B, Vol. 108 | 1 Sep 2014
- Column Subset Selection Problem is UG-hardJournal of Computer and System Sciences, Vol. 80, No. 4 | 1 Jun 2014
- A characterization of strong approximation resistanceProceedings of the forty-sixth annual ACM symposium on Theory of computing | 31 May 2014
- Super-polylogarithmic hypergraph coloring hardness via low-degree long codesProceedings of the forty-sixth annual ACM symposium on Theory of computing | 31 May 2014
- On judicious bisections of graphsJournal of Combinatorial Theory, Series B, Vol. 106 | 1 May 2014
- Guest columnACM SIGACT News, Vol. 45, No. 1 | 17 March 2014
- Complexity of approximating CSP with balance / hard constraintsProceedings of the 5th conference on Innovations in theoretical computer science | 12 January 2014
- Multireference alignment using semidefinite programmingProceedings of the 5th conference on Innovations in theoretical computer science | 12 January 2014
- Scheduling over Scenarios on Two MachinesComputing and Combinatorics | 1 Jan 2014
- Euclidean partitions optimizing noise stabilityElectronic Journal of Probability, Vol. 19, No. none | 1 Jan 2014
- The maximum cut problem on blow-ups of multiprojective spacesJournal of Algebraic Combinatorics, Vol. 38, No. 4 | 15 February 2013
- Explicit Optimal Hardness via Gaussian Stability ResultsACM Transactions on Computation Theory, Vol. 5, No. 4 | 1 November 2013
- Most Tensor Problems Are NP-HardJournal of the ACM, Vol. 60, No. 6 | 1 November 2013
- Robust Satisfiability for CSPsACM Transactions on Computation Theory, Vol. 5, No. 4 | 1 November 2013
- PCPs via Low-Degree Long Code and Hardness for Constrained Hypergraph Coloring2013 IEEE 54th Annual Symposium on Foundations of Computer Science | 1 Oct 2013
- Application of a MAX-CUT Heuristic to the Contig Orientation Problem in Genome AssemblyProceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics | 22 September 2013
- Solution of the Propeller Conjecture in $$\mathbb R ^3$$ R 3Discrete & Computational Geometry, Vol. 50, No. 2 | 6 August 2013
- Covering CSPs2013 IEEE Conference on Computational Complexity | 1 Jun 2013
- Sparsest cut on bounded treewidth graphsProceedings of the forty-fifth annual ACM symposium on Theory of Computing | 1 June 2013
- Majority is stablestProceedings of the forty-fifth annual ACM symposium on Theory of Computing | 1 June 2013
- Cones of multipowers and combinatorial optimization problemsComputational Mathematics and Mathematical Physics, Vol. 53, No. 5 | 24 May 2013
- Noise correlation bounds for uniform low degree functionsArkiv för Matematik, Vol. 51, No. 1 | 1 Apr 2013
- Towards an optimal query efficient PCP?Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 9 January 2013
- On the optimality of semidefinite relaxations for average-case and generalized constraint satisfactionProceedings of the 4th conference on Innovations in Theoretical Computer Science | 9 January 2013
- $\mathcal{NP}$-Hardness of Approximately Solving Linear Equations over RealsSIAM Journal on Computing, Vol. 42, No. 3 | 2 May 2013
- Probabilistic Verification and Non-approximabilityHandbook of Combinatorial Optimization | 26 July 2013
- The Approximability of the Binary Paintshop ProblemApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 1 Jan 2013
- THE GROTHENDIECK CONSTANT IS STRICTLY SMALLER THAN KRIVINE’S BOUNDForum of Mathematics, Pi, Vol. 1 | 19 November 2013
- Maximum edge‐cuts in cubic graphs with large girth and in random cubic graphsRandom Structures & Algorithms, Vol. 41, No. 4 | 26 September 2012
- Some applications of hypercontractive inequalities in quantum information theoryJournal of Mathematical Physics, Vol. 53, No. 12 | 10 December 2012
- An invariance principle for polytopesJournal of the ACM, Vol. 59, No. 6 | 9 January 2013
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization2012 IEEE 53rd Annual Symposium on Foundations of Computer Science | 1 Oct 2012
- Mapping Dynamic Bayesian Networks to $\alpha$-Shapes: Application to Human Faces Identification Across AgesIEEE Transactions on Neural Networks and Learning Systems, Vol. 23, No. 8 | 1 Aug 2012
- A hybridization between memetic algorithm and semidefinite relaxation for the max-cut problemProceedings of the 14th annual conference on Genetic and evolutionary computation | 7 July 2012
- Grothendieck‐Type Inequalities in Combinatorial OptimizationCommunications on Pure and Applied Mathematics, Vol. 65, No. 7 | 25 April 2012
- Pricing Loss Leaders Can be HardJournal of Computer Science and Technology, Vol. 27, No. 4 | 12 July 2012
- Maximally stable Gaussian partitions with discrete applicationsIsrael Journal of Mathematics, Vol. 189, No. 1 | 24 October 2011
- Gaussian Noise Sensitivity and Fourier Tails2012 IEEE 27th Conference on Computational Complexity | 1 Jun 2012
- Reductions between Expansion Problems2012 IEEE 27th Conference on Computational Complexity | 1 Jun 2012
- Solution of the propeller conjecture in R 3Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 19 May 2012
- A new point of NP-hardness for unique gamesProceedings of the forty-fourth annual ACM symposium on Theory of computing | 19 May 2012
- Approximation algorithms for semi-random partitioning problemsProceedings of the forty-fourth annual ACM symposium on Theory of computing | 19 May 2012
- Robust satisfiability of constraint satisfaction problemsProceedings of the forty-fourth annual ACM symposium on Theory of computing | 19 May 2012
- Approximating Linear Threshold PredicatesACM Transactions on Computation Theory, Vol. 4, No. 1 | 1 March 2012
- Bounds on locally testable codes with unique testsProceedings of the 3rd Innovations in Theoretical Computer Science Conference | 8 January 2012
- Agnostic Learning of Monomials by Halfspaces Is HardSIAM Journal on Computing, Vol. 41, No. 6 | 18 December 2012
- Relaxations of Combinatorial Problems Via Association SchemesHandbook on Semidefinite, Conic and Polynomial Optimization | 26 September 2011
- On Quadratic Programming with a Ratio ObjectiveAutomata, Languages, and Programming | 1 Jan 2012
- A New Point of NP-Hardness for 2-to-1 Label CoverApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 1 Jan 2012
- A Unified Continuous Greedy Algorithm for Submodular Maximization2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 1 Oct 2011
- A Two Prover One Round Game with Strong Soundness2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 1 Oct 2011
- How to Play Unique Games Against a Semi-random Adversary: Study of Semi-random Models of Unique Games2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 1 Oct 2011
- NP-hardness of approximately solving linear equations over realsProceedings of the forty-third annual ACM symposium on Theory of computing | 6 June 2011
- The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functionscomputational complexity, Vol. 20, No. 2 | 12 July 2011
- Non-negatively Weighted #CSP: An Effective Complexity Dichotomy2011 IEEE 26th Annual Conference on Computational Complexity | 1 Jun 2011
- Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups2011 IEEE 26th Annual Conference on Computational Complexity | 1 Jun 2011
- A Counterexample to Strong Parallel RepetitionSIAM Journal on Computing, Vol. 40, No. 3 | 23 June 2011
- Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation ResistantSIAM Journal on Computing, Vol. 40, No. 3 | 23 June 2011
- How to Play Unique Games on ExpandersApproximation and Online Algorithms | 1 Jan 2011
- Angular synchronization by eigenvectors and semidefinite programmingApplied and Computational Harmonic Analysis, Vol. 30, No. 1 | 1 Jan 2011
- An invariance principle for polytopesProceedings of the forty-second ACM symposium on Theory of computing | 5 June 2010
- Graph expansion and the unique games conjectureProceedings of the forty-second ACM symposium on Theory of computing | 5 June 2010
- No Strong Parallel Repetition with Entangled and Non-signaling Provers2010 IEEE 25th Annual Conference on Computational Complexity | 1 Jun 2010
- Gaussian Bounds for Noise Correlation of FunctionsGeometric and Functional Analysis, Vol. 19, No. 6 | 22 January 2010
- Hardness of Reconstructing Multivariate Polynomials over Finite FieldsSIAM Journal on Computing, Vol. 39, No. 6 | 30 April 2010
- Testing HalfspacesSIAM Journal on Computing, Vol. 39, No. 5 | 24 February 2010
- Towards Sharp Inapproximability for Any 2-CSPSIAM Journal on Computing, Vol. 39, No. 6 | 30 April 2010
- Unique Games with Entangled Provers Are EasySIAM Journal on Computing, Vol. 39, No. 7 | 15 July 2010
- Noise Sensitivity and Chaos in Social Choice TheoryFete of Combinatorics and Computer Science | 1 Jan 2010
- On the Inapproximability of Vertex Cover on k-Partite k-Uniform HypergraphsAutomata, Languages and Programming | 1 Jan 2010
- The Positive Semidefinite Grothendieck Problem with Rank ConstraintAutomata, Languages and Programming | 1 Jan 2010
- Improved Orientations of Physical NetworksAlgorithms in Bioinformatics | 1 Jan 2010
- Approximate Lasserre Integrality Gap for Unique GamesApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 1 Jan 2010
- Improved Rounding for Parallel Repeated Unique GamesApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 1 Jan 2010
- Query-Efficient Dictatorship Testing with Perfect CompletenessProperty Testing | 1 Jan 2010
- Noise stability of functions with low influences: Invariance and optimalityAnnals of Mathematics, Vol. 171, No. 1 | 17 March 2010
- Approximate Kernel ClusteringMathematika, Vol. 55, No. 1-2 | 1 December 2009
- Agnostic Learning of Monomials by Halfspaces Is Hard2009 50th Annual IEEE Symposium on Foundations of Computer Science | 1 Oct 2009
- SDP Integrality Gaps with Local ell_1-Embeddability2009 50th Annual IEEE Symposium on Foundations of Computer Science | 1 Oct 2009
- Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES2009 50th Annual IEEE Symposium on Foundations of Computer Science | 1 Oct 2009
- How to Round Any CSP2009 50th Annual IEEE Symposium on Foundations of Computer Science | 1 Oct 2009
- Hard constraint satisfaction problems have hard gaps at location 1Theoretical Computer Science, Vol. 410, No. 38-40 | 1 Sep 2009
- The status of the P versus NP problemCommunications of the ACM, Vol. 52, No. 9 | 1 September 2009
- Every Permutation CSP of arity 3 is Approximation Resistant2009 24th Annual IEEE Conference on Computational Complexity | 1 Jul 2009
- Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs2009 24th Annual IEEE Conference on Computational Complexity | 1 Jul 2009
- Near-optimal algorithms for maximum constraint satisfaction problemsACM Transactions on Algorithms, Vol. 5, No. 3 | 4 July 2009
- Testing juntas nearly optimallyProceedings of the forty-first annual ACM symposium on Theory of computing | 31 May 2009
- Conditional hardness for satisfiable 3-CSPsProceedings of the forty-first annual ACM symposium on Theory of computing | 31 May 2009
- Conditional Hardness for Approximate ColoringSIAM Journal on Computing, Vol. 39, No. 3 | 12 August 2009
- Approximability Distance in the Space of H-Colourability ProblemsComputer Science - Theory and Applications | 1 Jan 2009
- Improved Inapproximability Results for Maximum k-Colorable SubgraphApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 1 Jan 2009
- Gaussian Bounds for Noise Correlation of Functions and Tight Analysis of Long Codes2008 49th Annual IEEE Symposium on Foundations of Computer Science | 1 Oct 2008
- Unique Games with Entangled Provers are Easy2008 49th Annual IEEE Symposium on Foundations of Computer Science | 1 Oct 2008
- The approximability of MAX CSP with fixed-value constraintsJournal of the ACM, Vol. 55, No. 4 | 18 September 2008
- Approximation Resistant Predicates from Pairwise Independence2008 23rd Annual IEEE Conference on Computational Complexity | 1 Jun 2008
- An optimal sdp algorithm for max-cut, and equally optimal long code testsProceedings of the fortieth annual ACM symposium on Theory of computing | 17 May 2008
- Some topics in analysis of boolean functionsProceedings of the fortieth annual ACM symposium on Theory of computing | 17 May 2008
- Combination Can Be Hard: Approximability of the Unique Coverage ProblemSIAM Journal on Computing, Vol. 38, No. 4 | 8 September 2008
- Improved Approximation Guarantees through Higher Levels of SDP HierarchiesApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 1 Jan 2008
View Options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].