Published in: LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024)
Pavel Hubáček, Erfan Khaniki, and Neil Thapen. TFNP Intersections Through the Lens of Feasible Disjunction. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 287, pp. 63:1-63:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{hubacek_et_al:LIPIcs.ITCS.2024.63, author = {Hub\'{a}\v{c}ek, Pavel and Khaniki, Erfan and Thapen, Neil}, title = {{TFNP Intersections Through the Lens of Feasible Disjunction}}, booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)}, pages = {63:1--63:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-309-6}, ISSN = {1868-8969}, year = {2024}, volume = {287}, editor = {Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.63}, URN = {urn:nbn:de:0030-drops-195917}, doi = {10.4230/LIPIcs.ITCS.2024.63}, annote = {Keywords: TFNP, feasible disjunction, proof complexity, TFNP intersection classes} }
Published in: LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Tuomas Hakoniemi. Feasible Interpolation for Polynomial Calculus and Sums-Of-Squares. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 63:1-63:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{hakoniemi:LIPIcs.ICALP.2020.63, author = {Hakoniemi, Tuomas}, title = {{Feasible Interpolation for Polynomial Calculus and Sums-Of-Squares}}, booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, pages = {63:1--63:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-138-2}, ISSN = {1868-8969}, year = {2020}, volume = {168}, editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.63}, URN = {urn:nbn:de:0030-drops-124707}, doi = {10.4230/LIPIcs.ICALP.2020.63}, annote = {Keywords: Proof Complexity, Feasible Interpolation, Sums-of-Squares, Polynomial Calculus} }
Published in: LIPIcs, Volume 137, 34th Computational Complexity Conference (CCC 2019)
Albert Atserias and Tuomas Hakoniemi. Size-Degree Trade-Offs for Sums-of-Squares and Positivstellensatz Proofs. In 34th Computational Complexity Conference (CCC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 137, pp. 24:1-24:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{atserias_et_al:LIPIcs.CCC.2019.24, author = {Atserias, Albert and Hakoniemi, Tuomas}, title = {{Size-Degree Trade-Offs for Sums-of-Squares and Positivstellensatz Proofs}}, booktitle = {34th Computational Complexity Conference (CCC 2019)}, pages = {24:1--24:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-116-0}, ISSN = {1868-8969}, year = {2019}, volume = {137}, editor = {Shpilka, Amir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.24}, URN = {urn:nbn:de:0030-drops-108464}, doi = {10.4230/LIPIcs.CCC.2019.24}, annote = {Keywords: Proof complexity, semialgebraic proof systems, Sums-of-Squares, Positivstellensatz, trade-offs, lower bounds, monomial size, degree} }
Feedback for Dagstuhl Publishing