( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A certifying algorithm for lattice point feasibility in a system of UTVPI constraints.

, и . J. Comb. Optim., 35 (2): 389-408 (2018)

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.

Peter Wojciechowski

Georg Wojciechowski

Julia Wojciechowski

Klaus Wojciechowski

Peter Wojciechowski

 

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

Reachability in choice networks., , и . Discret. Optim., 48 (Part 1): 100761 (мая 2023)Erratum to: Analyzing restricted fragments of the theory of linear arithmetic., , и . Ann. Math. Artif. Intell., 79 (4): 371-392 (2017)New Results in Priority-Based Bin Packing., , и . ALGOCLOUD, том 13799 из Lecture Notes in Computer Science, стр. 58-72. Springer, (2022)A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems., , , , и . CALDAM, том 10743 из Lecture Notes in Computer Science, стр. 45-58. Springer, (2018)Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints., , и . FAW, том 10823 из Lecture Notes in Computer Science, стр. 300-314. Springer, (2018)Finding read-once refutations in 2CNF formulas and variants - a parameterized perspective., и . ISAIM, (2020)New Results on Cutting Plane Proofs for Horn Constraint Systems., , и . FSTTCS, том 150 из LIPIcs, стр. 43:1-43:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Strict Archimedean t-norms and t-conorms as universal approximators., , и . Int. J. Approx. Reason., 18 (3-4): 239-249 (1998)Analyzing restricted fragments of the theory of linear arithmetic., , и . Ann. Math. Artif. Intell., 79 (1-3): 245-266 (2017)Tree-Like Unit Refutations in Horn Constraint Systems., и . LATA, том 12638 из Lecture Notes in Computer Science, стр. 226-237. Springer, (2021)