Published in: LIPIcs, Volume 200, 36th Computational Complexity Conference (CCC 2021)
W. Cole Franks and Philipp Reichenbach. Barriers for Recent Methods in Geodesic Optimization. In 36th Computational Complexity Conference (CCC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 200, pp. 13:1-13:54, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{franks_et_al:LIPIcs.CCC.2021.13, author = {Franks, W. Cole and Reichenbach, Philipp}, title = {{Barriers for Recent Methods in Geodesic Optimization}}, booktitle = {36th Computational Complexity Conference (CCC 2021)}, pages = {13:1--13:54}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-193-1}, ISSN = {1868-8969}, year = {2021}, volume = {200}, editor = {Kabanets, Valentine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2021.13}, URN = {urn:nbn:de:0030-drops-142879}, doi = {10.4230/LIPIcs.CCC.2021.13}, annote = {Keywords: Geodesically Convex Optimization, Weight Margin, Moment Polytope, Diameter Bounds, Tensor Scaling, Matrix Scaling} }
Published in: LIPIcs, Volume 200, 36th Computational Complexity Conference (CCC 2021)
Peter Bürgisser, M. Levent Doğan, Visu Makam, Michael Walter, and Avi Wigderson. Polynomial Time Algorithms in Invariant Theory for Torus Actions. In 36th Computational Complexity Conference (CCC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 200, pp. 32:1-32:30, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{burgisser_et_al:LIPIcs.CCC.2021.32, author = {B\"{u}rgisser, Peter and Do\u{g}an, M. Levent and Makam, Visu and Walter, Michael and Wigderson, Avi}, title = {{Polynomial Time Algorithms in Invariant Theory for Torus Actions}}, booktitle = {36th Computational Complexity Conference (CCC 2021)}, pages = {32:1--32:30}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-193-1}, ISSN = {1868-8969}, year = {2021}, volume = {200}, editor = {Kabanets, Valentine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2021.32}, URN = {urn:nbn:de:0030-drops-143062}, doi = {10.4230/LIPIcs.CCC.2021.32}, annote = {Keywords: computational invariant theory, geometric complexity theory, orbit closure intersection problem} }
Published in: LIPIcs, Volume 187, 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)
Peter Bürgisser. Optimization, Complexity and Invariant Theory (Invited Talk). In 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 187, pp. 1:1-1:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{burgisser:LIPIcs.STACS.2021.1, author = {B\"{u}rgisser, Peter}, title = {{Optimization, Complexity and Invariant Theory}}, booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)}, pages = {1:1--1:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-180-1}, ISSN = {1868-8969}, year = {2021}, volume = {187}, editor = {Bl\"{a}ser, Markus and Monmege, Benjamin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.1}, URN = {urn:nbn:de:0030-drops-136460}, doi = {10.4230/LIPIcs.STACS.2021.1}, annote = {Keywords: geometric invariant theory, geodesic optimization, non-commutative optimization, null cone, operator scaling, moment polytope, orbit closure intersection, geometric programming} }
Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Nikhil Gupta and Chandan Saha. On the Symmetries of and Equivalence Test for Design Polynomials. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 53:1-53:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{gupta_et_al:LIPIcs.MFCS.2019.53, author = {Gupta, Nikhil and Saha, Chandan}, title = {{On the Symmetries of and Equivalence Test for Design Polynomials}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {53:1--53:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.53}, URN = {urn:nbn:de:0030-drops-109979}, doi = {10.4230/LIPIcs.MFCS.2019.53}, annote = {Keywords: Nisan-Wigderson design polynomial, characterization by symmetries, Lie algebra, group of symmetries, circuit testability, flip theorem, equivalence test} }
Published in: LIPIcs, Volume 94, 9th Innovations in Theoretical Computer Science Conference (ITCS 2018)
Peter Bürgisser, Ankit Garg, Rafael Oliveira, Michael Walter, and Avi Wigderson. Alternating Minimization, Scaling Algorithms, and the Null-Cone Problem from Invariant Theory. In 9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 94, pp. 24:1-24:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{burgisser_et_al:LIPIcs.ITCS.2018.24, author = {B\"{u}rgisser, Peter and Garg, Ankit and Oliveira, Rafael and Walter, Michael and Wigderson, Avi}, title = {{Alternating Minimization, Scaling Algorithms, and the Null-Cone Problem from Invariant Theory}}, booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)}, pages = {24:1--24:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-060-6}, ISSN = {1868-8969}, year = {2018}, volume = {94}, editor = {Karlin, Anna R.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.24}, URN = {urn:nbn:de:0030-drops-83510}, doi = {10.4230/LIPIcs.ITCS.2018.24}, annote = {Keywords: alternating minimization, tensors, scaling, quantum marginal problem, null cone, invariant theory, geometric complexity theory} }
Published in: Dagstuhl Reports, Volume 5, Issue 6 (2016)
Peter Bürgisser, Felipe Cucker, Marek Karpinski, and Nicolai Vorobjov. Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242). In Dagstuhl Reports, Volume 5, Issue 6, pp. 28-47, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@Article{burgisser_et_al:DagRep.5.6.28, author = {B\"{u}rgisser, Peter and Cucker, Felipe and Karpinski, Marek and Vorobjov, Nicolai}, title = {{Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242)}}, pages = {28--47}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2016}, volume = {5}, number = {6}, editor = {B\"{u}rgisser, Peter and Cucker, Felipe and Karpinski, Marek and Vorobjov, Nicolai}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.6.28}, URN = {urn:nbn:de:0030-drops-55066}, doi = {10.4230/DagRep.5.6.28}, annote = {Keywords: Symbolic computation, Algorithms in real algebraic geometry, Complexity lower bounds, Geometry of numerical algorithms} }
Published in: LIPIcs, Volume 29, 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014)
Taolue Chen and Tingting Han. On the Complexity of Computing Maximum Entropy for Markovian Models. In 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 29, pp. 571-583, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{chen_et_al:LIPIcs.FSTTCS.2014.571, author = {Chen, Taolue and Han, Tingting}, title = {{On the Complexity of Computing Maximum Entropy for Markovian Models}}, booktitle = {34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014)}, pages = {571--583}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-77-4}, ISSN = {1868-8969}, year = {2014}, volume = {29}, editor = {Raman, Venkatesh and Suresh, S. P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2014.571}, URN = {urn:nbn:de:0030-drops-48725}, doi = {10.4230/LIPIcs.FSTTCS.2014.571}, annote = {Keywords: Markovian Models, Entropy, Complexity, Probabilistic Verification} }
Published in: Dagstuhl Reports, Volume 3, Issue 1 (2013)
Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum, and Pascal Koiran. Computational Counting (Dagstuhl Seminar 13031). In Dagstuhl Reports, Volume 3, Issue 1, pp. 47-66, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@Article{burgisser_et_al:DagRep.3.1.47, author = {B\"{u}rgisser, Peter and Goldberg, Leslie Ann and Jerrum, Mark and Koiran, Pascal}, title = {{Computational Counting (Dagstuhl Seminar 13031)}}, pages = {47--66}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2013}, volume = {3}, number = {1}, editor = {B\"{u}rgisser, Peter and Goldberg, Leslie Ann and Jerrum, Mark and Koiran, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.1.47}, URN = {urn:nbn:de:0030-drops-40087}, doi = {10.4230/DagRep.3.1.47}, annote = {Keywords: Computational complexity, counting problems, graph polynomials, holographic algorithms, statistical physics, constraint satisfaction} }
Published in: Dagstuhl Seminar Proceedings, Volume 10481, Computational Counting (2011)
Peter Bürgisser, Leslie Ann Goldberg, and Mark Jerrum. 10481 Abstracts Collection – Computational Counting. In Computational Counting. Dagstuhl Seminar Proceedings, Volume 10481, pp. 1-15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)
@InProceedings{burgisser_et_al:DagSemProc.10481.1, author = {B\"{u}rgisser, Peter and Goldberg, Leslie Ann and Jerrum, Mark}, title = {{10481 Abstracts Collection – Computational Counting}}, booktitle = {Computational Counting}, pages = {1--15}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2011}, volume = {10481}, editor = {Peter B\"{u}rgisser and Leslie Ann Goldberg and Mark Jerrum}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10481.1}, URN = {urn:nbn:de:0030-drops-29453}, doi = {10.4230/DagSemProc.10481.1}, annote = {Keywords: Computational complexity, counting problems, holographic algorithms, statistical physics, constraint satisfaction} }
Published in: Dagstuhl Seminar Proceedings, Volume 10481, Computational Counting (2011)
Peter Bürgisser, Leslie Ann Goldberg, and Mark Jerrum. 10481 Executive Summary – Computational Counting. In Computational Counting. Dagstuhl Seminar Proceedings, Volume 10481, pp. 1-3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)
@InProceedings{burgisser_et_al:DagSemProc.10481.2, author = {B\"{u}rgisser, Peter and Goldberg, Leslie Ann and Jerrum, Mark}, title = {{10481 Executive Summary – Computational Counting}}, booktitle = {Computational Counting}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2011}, volume = {10481}, editor = {Peter B\"{u}rgisser and Leslie Ann Goldberg and Mark Jerrum}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10481.2}, URN = {urn:nbn:de:0030-drops-29441}, doi = {10.4230/DagSemProc.10481.2}, annote = {Keywords: Computational complexity, counting problems, holographic algorithms, statistical physics, constraint satisfaction} }
Published in: Dagstuhl Seminar Proceedings, Volume 6111, Complexity of Boolean Functions (2006)
Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, and Peter Bro Miltersen. On the Complexity of Numerical Analysis. In Complexity of Boolean Functions. Dagstuhl Seminar Proceedings, Volume 6111, pp. 1-9, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
@InProceedings{allender_et_al:DagSemProc.06111.12, author = {Allender, Eric and B\"{u}rgisser, Peter and Kjeldgaard-Pedersen, Johan and Miltersen, Peter Bro}, title = {{On the Complexity of Numerical Analysis}}, booktitle = {Complexity of Boolean Functions}, pages = {1--9}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6111}, editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.12}, URN = {urn:nbn:de:0030-drops-6130}, doi = {10.4230/DagSemProc.06111.12}, annote = {Keywords: Blum-Shub-Smale Model, Euclidean Traveling Salesman Problem, Counting Hierarchy} }
Feedback for Dagstuhl Publishing