Found 3 Documents (Results 1–3)
The complexity of the ideal membership problem for constrained problems over the Boolean domain. (English) Zbl 1431.68050
Chan, Timothy M. (ed.), Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6–9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 456-475 (2019).
On the bit complexity of sum-of-squares proofs. (English) Zbl 1441.68100
Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 80, 13 p. (2017).
Filter Results by …
Document Type
- Journal Articles (1)
- Collection Articles (2)
Author
- Mastrolilli, Monaldo (2)
- Raghavendra, Prasad (1)
- Weitz, Benjamin (1)
