( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Reducing NEXP-complete problems to DQBF.

, , , и . FMCAD, стр. 199-204. IEEE, (2022)

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.

Mohamed Ahmed Tony Ahmed Marzok

Hans-Peter Tony

Tony Franken

Tony Noll

Tony Mudrack

 

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

Tree Automata over Infinite Alphabets., и . Pillars of Computer Science, том 4800 из Lecture Notes in Computer Science, стр. 386-423. Springer, (2008)Efficient reasoning about data trees via integer linear programming., , и . ACM Trans. Database Syst., 37 (3): 19:1-19:28 (2012)Efficient reasoning about data trees via integer linear programming., , и . ICDT, стр. 18-29. ACM, (2011)Reducing NEXP-complete problems to DQBF., , , и . FMCAD, стр. 199-204. IEEE, (2022)Distributed Streaming with Finite Memory., , , и . ICDT, том 31 из LIPIcs, стр. 324-341. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Two Variable Logic with Ultimately Periodic Counting., , и . ICALP, том 168 из LIPIcs, стр. 112:1-112:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On the Complexity of k-DQBF., и . SAT, том 271 из LIPIcs, стр. 10:1-10:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Separating Counting from Non-Counting in Fragments of Two-Variable First-Order Logic (Extended Abstract)., , , и . Description Logics, том 3739 из CEUR Workshop Proceedings, CEUR-WS.org, (2024)Automata for two-variable logic over trees with ordered data values. CoRR, (2012)Subdividing Alpha Complex., и . FSTTCS, том 3328 из Lecture Notes in Computer Science, стр. 186-197. Springer, (2004)