Number of the records: 1
Shadows of Newton polytopes
- 1.0546776 - MÚ 2022 RIV DE eng C - Conference Paper (international conference)
Hrubeš, Pavel - Yehudayoff, A.
Shadows of Newton polytopes.
36th Computational Complexity Conference (CCC 2021). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2021 - (Kabanets, V.), č. článku 9. Leibniz International Proceedings in Informatics, 200. ISBN 978-3-95977-193-1. ISSN 1868-8969.
[36th Computational Complexity Conference (CCC 2021). Toronto (CA), 20.07.2021-23.07.2021]
R&D Projects: GA ČR(CZ) GX19-27871X
Institutional support: RVO:67985840
Keywords : Newton polytope * monotone arithmetic circuit
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://dx.doi.org/10.4230/LIPIcs.CCC.2021.9
We define the shadow complexity of a polytope P as the maximum number of vertices in a linear projection of P to the plane. We describe connections to algebraic complexity and to parametrized optimization. We also provide several basic examples and constructions, and develop tools for bounding shadow complexity.
Permanent Link: http://hdl.handle.net/11104/0323159
File Download Size Commentary Version Access Hrubes.pdf 2 687.8 KB Publisher’s postprint open-access
Number of the records: 1