( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems.

, , , , и . CALDAM, том 10743 из Lecture Notes in Computer Science, стр. 45-58. Springer, (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

Klaus Wojciechowski

Georg Wojciechowski

Julia Wojciechowski

Heike Wojciechowski

 

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

Analyzing fractional Horn constraint systems., , и . Theor. Comput. Sci., (2020)Reachability in choice networks., , и . Discret. Optim., 48 (Part 1): 100761 (мая 2023)NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability., , и . Math. Struct. Comput. Sci., 30 (7): 736-751 (2020)Erratum to: Analyzing restricted fragments of the theory of linear arithmetic., , и . Ann. Math. Artif. Intell., 79 (4): 371-392 (2017)Read-once refutations in Horn constraint systems: an algorithmic approach., , и . J. Log. Comput., 32 (4): 667-696 (2022)A complexity perspective on entailment of parameterized linear constraints., , , и . Constraints An Int. J., 17 (4): 461-487 (2012)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)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)Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints., , и . FAW, том 10823 из Lecture Notes in Computer Science, стр. 300-314. Springer, (2018)