( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Lower Bounds for Arithmetic Circuits via the Hankel Matrix.

, , , и . STACS, том 154 из LIPIcs, стр. 24:1-24:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Ohlmann

Lothar Öhlmann

Andre Öhlmann

Andreas Ohlmann

Susanne Ohlmann

 

Другие публикации лиц с тем же именем

Lower Bounds for Arithmetic Circuits via the Hankel Matrix., , , и . Comput. Complex., 30 (2): 14 (2021)Monotonic graphs for parity and mean-payoff games. (Graphes monotones pour jeux de parité et à paiement moyen).. Université Paris Cité, France, (2021)Tight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees., , и . Electron. Colloquium Comput. Complex., (2018)Positional ω-regular languages., и . LICS, стр. 21:1-21:14. ACM, (2024)Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games., , и . MFCS, том 170 из LIPIcs, стр. 34:1-34:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On the Monniaux Problem in Abstract Interpretation., , , , , и . SAS, том 11822 из Lecture Notes in Computer Science, стр. 162-180. Springer, (2019)Controlling a Random Population., , и . FoSSaCS, том 12077 из Lecture Notes in Computer Science, стр. 119-135. Springer, (2020)Positionality in Σ⁰₂ and a Completeness Result., и . STACS, том 289 из LIPIcs, стр. 54:1-54:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Characterising memory in infinite games., и . CoRR, (2022)Characterizing Positionality in Games of Infinite Duration over Infinite Graphs.. LICS, стр. 22:1-22:12. ACM, (2022)