Lower bounds of functions on finite abelian groups

DOI10.1007/978-3-031-49193-1_12MaRDI QIDQ6591628

Unnamed Author, Ke Ye, Lihong Zhi

Publication date: 22 August 2024

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

Computing sparse Fourier sum of squares on finite abelian groups in quasi-linear time

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Sparse sums of squares on finite abelian groups and improved semidefinite lifts
Sums of squares based approximation algorithms for MAX-SAT
The complexity of optimization problems
The Euclidean traveling salesman problem is NP-complete
A MAX-CUT formulation of 0/1 programs
Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
A proof builder for Max-SAT
Worst-case analysis of a new heuristic for the travelling salesman problem
Global Optimization with Polynomials and the Problem of Moments
Ottimizzazione Combinatoria
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
Reducibility among Combinatorial Problems
TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
Analysis of Boolean Functions
Analytical approach to parallel repetition
Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
The complexity of theorem-proving procedures
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
On the partition of numbers.
Sum-of-squares hierarchies for binary polynomial optimization
CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization

This page was built for publication: Lower bounds of functions on finite abelian groups