First-Order Reasoning and Efficient Semi-Algebraic Proofs

Semi-algebraic proof systems such as sum-of-squares (SoS) have attracted a lot of attention recently due to their relation to approximation algorithms [3]: constant degree semi-algebraic proofs lead to conjecturally optimal polynomial-time approximation algorithms for important NP-hard optimization...

Full description

Bibliographic Details

Published in:	Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 1 - 13
Main Authors:	Part, Fedor, Thapen, Neil, Tzameret, Iddo
Format:	Conference Proceeding
Language:	English
Published:	IEEE 29.06.2021
Subjects:	Approximation algorithms Calculus Cognition Computational modeling Computer science Lead Systematics
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!