Published in: LIPIcs, Volume 300, 39th Computational Complexity Conference (CCC 2024)
Kiran S. Kedlaya and Swastik Kopparty. On the Degree of Polynomials Computing Square Roots Mod p. In 39th Computational Complexity Conference (CCC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 300, pp. 25:1-25:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{kedlaya_et_al:LIPIcs.CCC.2024.25, author = {Kedlaya, Kiran S. and Kopparty, Swastik}, title = {{On the Degree of Polynomials Computing Square Roots Mod p}}, booktitle = {39th Computational Complexity Conference (CCC 2024)}, pages = {25:1--25:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-331-7}, ISSN = {1868-8969}, year = {2024}, volume = {300}, editor = {Santhanam, Rahul}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.25}, URN = {urn:nbn:de:0030-drops-204219}, doi = {10.4230/LIPIcs.CCC.2024.25}, annote = {Keywords: Algebraic Computation, Polynomials, Computing Square roots, Reed-Solomon Codes} }
Published in: LIPIcs, Volume 300, 39th Computational Complexity Conference (CCC 2024)
Michael A. Forbes. Low-Depth Algebraic Circuit Lower Bounds over Any Field. In 39th Computational Complexity Conference (CCC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 300, pp. 31:1-31:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{forbes:LIPIcs.CCC.2024.31, author = {Forbes, Michael A.}, title = {{Low-Depth Algebraic Circuit Lower Bounds over Any Field}}, booktitle = {39th Computational Complexity Conference (CCC 2024)}, pages = {31:1--31:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-331-7}, ISSN = {1868-8969}, year = {2024}, volume = {300}, editor = {Santhanam, Rahul}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.31}, URN = {urn:nbn:de:0030-drops-204271}, doi = {10.4230/LIPIcs.CCC.2024.31}, annote = {Keywords: algebraic circuits, lower bounds, low-depth circuits, positive characteristic} }
Published in: LIPIcs, Volume 297, 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)
Omkar Baraskar, Agrim Dewan, Chandan Saha, and Pulkit Sinha. NP-Hardness of Testing Equivalence to Sparse Polynomials and to Constant-Support Polynomials. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 16:1-16:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{baraskar_et_al:LIPIcs.ICALP.2024.16, author = {Baraskar, Omkar and Dewan, Agrim and Saha, Chandan and Sinha, Pulkit}, title = {{NP-Hardness of Testing Equivalence to Sparse Polynomials and to Constant-Support Polynomials}}, booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)}, pages = {16:1--16:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-322-5}, ISSN = {1868-8969}, year = {2024}, volume = {297}, editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.16}, URN = {urn:nbn:de:0030-drops-201598}, doi = {10.4230/LIPIcs.ICALP.2024.16}, annote = {Keywords: Equivalence testing, MCSP, sparse polynomials, 3SAT} }
Published in: LIPIcs, Volume 297, 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)
Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki, and Tamás Schwarcz. Problems on Group-Labeled Matroid Bases. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 86:1-86:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{horsch_et_al:LIPIcs.ICALP.2024.86, author = {H\"{o}rsch, Florian and Imolay, Andr\'{a}s and Mizutani, Ryuhei and Oki, Taihei and Schwarcz, Tam\'{a}s}, title = {{Problems on Group-Labeled Matroid Bases}}, booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)}, pages = {86:1--86:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-322-5}, ISSN = {1868-8969}, year = {2024}, volume = {297}, editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.86}, URN = {urn:nbn:de:0030-drops-202299}, doi = {10.4230/LIPIcs.ICALP.2024.86}, annote = {Keywords: matroids, matroid intersection, congruency constraint, exact-weight constraint, additive combinatorics, algebraic algorithm, strongly base orderability} }
Published in: LIPIcs, Volume 9, 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)
Bruno Grenet, Erich L. Kaltofen, Pascal Koiran, and Natacha Portier. Symmetric Determinantal Representation of Weakly-Skew Circuits. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 543-554, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{grenet_et_al:LIPIcs.STACS.2011.543, author = {Grenet, Bruno and Kaltofen, Erich L. and Koiran, Pascal and Portier, Natacha}, title = {{Symmetric Determinantal Representation of Weakly-Skew Circuits}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {543--554}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.543}, URN = {urn:nbn:de:0030-drops-30426}, doi = {10.4230/LIPIcs.STACS.2011.543}, annote = {Keywords: algebraic complexity, determinant and permanent of symmetric matrices, formulas, skew circuits, Valiant’s classes} }
Published in: Dagstuhl Seminar Proceedings, Volume 9471, Computer-assisted proofs - tools, methods and applications (2010)
Malcolm B. Brown, Erich Kaltofen, Shin'ichi Oishi, and Siegfried M. Rump. 09471 Abstracts Collection – Computer-assisted proofs - tools, methods and applications. In Computer-assisted proofs - tools, methods and applications. Dagstuhl Seminar Proceedings, Volume 9471, pp. 1-24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{brown_et_al:DagSemProc.09471.1, author = {Brown, Malcolm B. and Kaltofen, Erich and Oishi, Shin'ichi and Rump, Siegfried M.}, title = {{09471 Abstracts Collection – Computer-assisted proofs - tools, methods and applications}}, booktitle = {Computer-assisted proofs - tools, methods and applications}, pages = {1--24}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {9471}, editor = {B. Malcolm Brown and Erich Kaltofen and Shin'ichi Oishi and Siegfried M. Rump}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09471.1}, URN = {urn:nbn:de:0030-drops-25328}, doi = {10.4230/DagSemProc.09471.1}, annote = {Keywords: Verification methods, computer algebra, computer-assisted proofs} }
Published in: Dagstuhl Seminar Proceedings, Volume 9471, Computer-assisted proofs - tools, methods and applications (2010)
Malcolm B. Brown, Erich Kaltofen, Shin'ichi Oishi, and Siegfried M. Rump. 09471 Executive Summary – Computer-assisted proofs - tools, methods and applications. In Computer-assisted proofs - tools, methods and applications. Dagstuhl Seminar Proceedings, Volume 9471, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{brown_et_al:DagSemProc.09471.2, author = {Brown, Malcolm B. and Kaltofen, Erich and Oishi, Shin'ichi and Rump, Siegfried M.}, title = {{09471 Executive Summary – Computer-assisted proofs - tools, methods and applications}}, booktitle = {Computer-assisted proofs - tools, methods and applications}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {9471}, editor = {B. Malcolm Brown and Erich Kaltofen and Shin'ichi Oishi and Siegfried M. Rump}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09471.2}, URN = {urn:nbn:de:0030-drops-25316}, doi = {10.4230/DagSemProc.09471.2}, annote = {Keywords: Verification methods, computer algebra, computer-assisted proofs} }
Published in: Dagstuhl Seminar Proceedings, Volume 9471, Computer-assisted proofs - tools, methods and applications (2010)
Andreas Rauh and Ekaterina Auer. Interval Approaches to Reliable Control of Dynamical Systems. In Computer-assisted proofs - tools, methods and applications. Dagstuhl Seminar Proceedings, Volume 9471, pp. 1-28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{rauh_et_al:DagSemProc.09471.3, author = {Rauh, Andreas and Auer, Ekaterina}, title = {{Interval Approaches to Reliable Control of Dynamical Systems}}, booktitle = {Computer-assisted proofs - tools, methods and applications}, pages = {1--28}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {9471}, editor = {B. Malcolm Brown and Erich Kaltofen and Shin'ichi Oishi and Siegfried M. Rump}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09471.3}, URN = {urn:nbn:de:0030-drops-25120}, doi = {10.4230/DagSemProc.09471.3}, annote = {Keywords: Robust control, Ordinary differential equations, Differential-algebraic equations} }
Published in: Dagstuhl Seminar Proceedings, Volume 9471, Computer-assisted proofs - tools, methods and applications (2010)
Ekaterina Auer, Roger Cuypers, Eva Dyllong, Stefan Kiel, and Wolfram Luther. Verification and Validation for Femur Prosthesis Surgery. In Computer-assisted proofs - tools, methods and applications. Dagstuhl Seminar Proceedings, Volume 9471, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{auer_et_al:DagSemProc.09471.4, author = {Auer, Ekaterina and Cuypers, Roger and Dyllong, Eva and Kiel, Stefan and Luther, Wolfram}, title = {{Verification and Validation for Femur Prosthesis Surgery}}, booktitle = {Computer-assisted proofs - tools, methods and applications}, pages = {1--22}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {9471}, editor = {B. Malcolm Brown and Erich Kaltofen and Shin'ichi Oishi and Siegfried M. Rump}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09471.4}, URN = {urn:nbn:de:0030-drops-25133}, doi = {10.4230/DagSemProc.09471.4}, annote = {Keywords: Graphical interface construction, superquadrics, 3D modeling, biomedical engineering} }
Published in: Dagstuhl Seminar Proceedings, Volume 6271, Challenges in Symbolic Computation Software (2006)
Marc Moreno Maza, Oleg Golubitsky, Marina V. Kondratieva, and Alexey Ovchinnikov. Bounds and algebraic algorithms in differential algebra: the ordinary case. In Challenges in Symbolic Computation Software. Dagstuhl Seminar Proceedings, Volume 6271, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{morenomaza_et_al:DagSemProc.06271.4, author = {Moreno Maza, Marc and Golubitsky, Oleg and Kondratieva, Marina V. and Ovchinnikov, Alexey}, title = {{Bounds and algebraic algorithms in differential algebra: the ordinary case}}, booktitle = {Challenges in Symbolic Computation Software}, pages = {1--9}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6271}, editor = {Wolfram Decker and Mike Dewar and Erich Kaltofen and Stephen Watt}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06271.4}, URN = {urn:nbn:de:0030-drops-10219}, doi = {10.4230/DagSemProc.06271.4}, annote = {Keywords: Differential algebra, Rosenfeld Groebner Algorithm} }
Published in: Dagstuhl Seminar Proceedings, Volume 6271, Challenges in Symbolic Computation Software (2006)
Stephen M. Watt. Two Families of Algorithms for Symbolic Polynomials. In Challenges in Symbolic Computation Software. Dagstuhl Seminar Proceedings, Volume 6271, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{watt:DagSemProc.06271.15, author = {Watt, Stephen M.}, title = {{Two Families of Algorithms for Symbolic Polynomials}}, booktitle = {Challenges in Symbolic Computation Software}, pages = {1--20}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6271}, editor = {Wolfram Decker and Mike Dewar and Erich Kaltofen and Stephen Watt}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06271.15}, URN = {urn:nbn:de:0030-drops-7933}, doi = {10.4230/DagSemProc.06271.15}, annote = {Keywords: Computer algebra, symbolic computation, factorization, gcd, symbolic exponents} }
Published in: Dagstuhl Seminar Proceedings, Volume 6271, Challenges in Symbolic Computation Software (2006)
Wolfram Decker, Mike Dewar, Erich Kaltofen, and Stephen M. Watt. 06271 Abstracts Collection – Challenges in Symbolic Computation Software. In Challenges in Symbolic Computation Software. Dagstuhl Seminar Proceedings, Volume 6271, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{decker_et_al:DagSemProc.06271.1, author = {Decker, Wolfram and Dewar, Mike and Kaltofen, Erich and Watt, Stephen M.}, title = {{06271 Abstracts Collection – Challenges in Symbolic Computation Software}}, booktitle = {Challenges in Symbolic Computation Software}, pages = {1--16}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6271}, editor = {Wolfram Decker and Mike Dewar and Erich Kaltofen and Stephen Watt}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06271.1}, URN = {urn:nbn:de:0030-drops-7814}, doi = {10.4230/DagSemProc.06271.1}, annote = {Keywords: Symbolic computation, computer algebra, computational algebraic geometry, combinatorial methods in algebra, hybrid, symbolic-numerical methods, algorithm design, symbolic computation languages, systems and user interfaces} }
Published in: Dagstuhl Seminar Proceedings, Volume 6271, Challenges in Symbolic Computation Software (2006)
Stephen M. Watt. Pivot-Free Block Matrix Inversion. In Challenges in Symbolic Computation Software. Dagstuhl Seminar Proceedings, Volume 6271, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{watt:DagSemProc.06271.13, author = {Watt, Stephen M.}, title = {{Pivot-Free Block Matrix Inversion}}, booktitle = {Challenges in Symbolic Computation Software}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6271}, editor = {Wolfram Decker and Mike Dewar and Erich Kaltofen and Stephen Watt}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06271.13}, URN = {urn:nbn:de:0030-drops-7806}, doi = {10.4230/DagSemProc.06271.13}, annote = {Keywords: Linear algebra, block matrices, matrix inverse} }
Published in: Dagstuhl Seminar Proceedings, Volume 6271, Challenges in Symbolic Computation Software (2006)
Wolfram Decker, Mike Dewar, Erich Kaltofen, and Stephen M. Watt. 06271 Executive Summary - Challenges in Symbolic Computation Software. In Challenges in Symbolic Computation Software. Dagstuhl Seminar Proceedings, Volume 6271, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{decker_et_al:DagSemProc.06271.2, author = {Decker, Wolfram and Dewar, Mike and Kaltofen, Erich and Watt, Stephen M.}, title = {{06271 Executive Summary - Challenges in Symbolic Computation Software}}, booktitle = {Challenges in Symbolic Computation Software}, pages = {1--2}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6271}, editor = {Wolfram Decker and Mike Dewar and Erich Kaltofen and Stephen Watt}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06271.2}, URN = {urn:nbn:de:0030-drops-7778}, doi = {10.4230/DagSemProc.06271.2}, annote = {Keywords: Symbolic computation, computer algebra, computational algebraic geometry, combinatorial methods in algebra, hybrid symbolic-numerical methods, algori} }
Published in: Dagstuhl Seminar Proceedings, Volume 6271, Challenges in Symbolic Computation Software (2006)
Jean-Guillaume Dumas, Clément Pernet, and Jean-Louis Roch. Adaptive Triangular System Solving. In Challenges in Symbolic Computation Software. Dagstuhl Seminar Proceedings, Volume 6271, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{dumas_et_al:DagSemProc.06271.3, author = {Dumas, Jean-Guillaume and Pernet, Cl\'{e}ment and Roch, Jean-Louis}, title = {{Adaptive Triangular System Solving}}, booktitle = {Challenges in Symbolic Computation Software}, pages = {1--18}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6271}, editor = {Wolfram Decker and Mike Dewar and Erich Kaltofen and Stephen Watt}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06271.3}, URN = {urn:nbn:de:0030-drops-7704}, doi = {10.4230/DagSemProc.06271.3}, annote = {Keywords: Adaptive and hybrid algorithms; triangular system solving; parallel and sequential degenerations} }