( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Affine Extensions of Integer Vector Addition Systems with States

, , , и . (2019)https://arxiv.org/abs/1909.12386.

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.

Christoph Haase

Christoph Haase

Christoph Haase

Christoph Haase

Christoph Haase

 

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

Complexity of Subsumption in the Escr Lscr Family of Description Logics: Acyclic and Cyclic TBoxes., и . ECAI, том 178 из Frontiers in Artificial Intelligence and Applications, стр. 25-29. IOS Press, (2008)Approaching Arithmetic Theories with Finite-State Automata.. LATA, том 12038 из Lecture Notes in Computer Science, стр. 33-43. Springer, (2020)Geometric decision procedures and the VC dimension of linear arithmetic theories., , и . LICS, стр. 59:1-59:13. ACM, (2022)Semënov Arithmetic, Affine VASS, and String Constraints., , и . STACS, том 289 из LIPIcs, стр. 29:1-29:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)On the Power of Ordering in Linear Arithmetic Theories., и . ICALP, том 168 из LIPIcs, стр. 119:1-119:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Affine Extensions of Integer Vector Addition Systems with States, , , и . (2019)https://arxiv.org/abs/1909.12386.Reachability in Fixed VASS: Expressiveness and Lower Bounds., , и . CoRR, (2023)An Efficient Quantifier Elimination Procedure for Presburger Arithmetic., , , , и . ICALP, том 297 из LIPIcs, стр. 142:1-142:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Universal Quantification Makes Automatic Structures Hard to Decide., и . CONCUR, том 279 из LIPIcs, стр. 13:1-13:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Integer Programming with GCD Constraints., , , и . SODA, стр. 3605-3658. SIAM, (2024)