On the Bit Complexity of Sum-of-Squares Proofs — mentioned by NotOscarWilde

Sun, 27 Jan 2019 01:56:57 GMT

Any context for why it appeared just now? On a personal note, it is almost eerie that it appeared just as I finished a week in Chile at a workshop [1] looking into Buchberger's algorithm and the connections between Gröbner bases and bit complexity of proofs via sums of squares [2, 3]. [1]: https://sites.google.com/view/vverdugo/events/hierarchies-an... [2]: https://www.cs.cmu.edu/~odonnell/papers/sos-automatizability... [3]: https://arxiv.org/abs/1702.05139

Paper and discussion history. A mention is not an endorsement.

On the Bit Complexity of Sum-of-Squares Proofs · HackerPapers discussions

On the Bit Complexity of Sum-of-Squares Proofs — mentioned by NotOscarWilde