Cited By
View all- Li JVouk MReeves DPancake C(1992)Improvements to systematic program developmentProceedings of the 30th annual ACM Southeast Regional Conference10.1145/503720.503763(308-311)Online publication date: 8-Apr-1992
This work is concerned with the proof-complexity of certifying that optimization problems do not have good solutions. Specifically we consider bounded-degree "Sum of Squares" (SOS) proofs, a powerful algebraic proof system introduced in 1999 by ...
A proof system for a language L is a function f such that Range(f) is exactly L. In this article, we look at proof systems from a circuit complexity point of view and study proof systems that are computationally very restricted. The restriction we study ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in