Lower bounds of functions on finite abelian groups
type: Item
instance of: scholarly article
title: Lower bounds of functions on finite abelian groups
DOI: 10.1007/978-3-031-49193-1_12
author: Q6081981
author: Ke Ye
author: Lihong Zhi
publication date: 2024-08-22T00:00:00Z
Mathematics Subject Classification ID: 68Rxx
zbMATH DE Number: 7900439
MaRDI profile type: MaRDI publication profile
cites work: Worst-case analysis of a new heuristic for the travelling salesman problem
cites work: The complexity of theorem-proving procedures
cites work: Analytical approach to parallel repetition
cites work: Sparse sums of squares on finite abelian groups and improved semidefinite lifts
cites work: Q4002278
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Reducibility among Combinatorial Problems
cites work: Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
cites work: Ottimizzazione Combinatoria
cites work: The complexity of optimization problems
cites work: Global optimization with polynomials and the problem of moments
cites work: A MAX-CUT formulation of 0/1 programs
cites work: A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
cites work: Q4737518
cites work: Q3993418
cites work: On the partition of numbers.
cites work: Analysis of Boolean Functions
cites work: The Euclidean traveling salesman problem is NP-complete
cites work: Q4298260
cites work: A proof builder for Max-SAT
cites work: Q3549708
cites work: Q3293614
cites work: Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
cites work: Q4228498
cites work: Sum-of-squares hierarchies for binary polynomial optimization
cites work: SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
cites work: Sums of squares based approximation algorithms for MAX-SAT
cites work: Q4782696
cites work: Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
cites work: CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
cites work: TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
cites work: Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
description: scientific article; zbMATH DE number 7900439