From post

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)

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.

 

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

On the Design and Implementation of a Shared Memory Dispatcher for Partially Clairvoyant Schedulers., и . Int. J. Parallel Program., 36 (4): 386-411 (2008)Randomized algorithms for finding the shortest negative cost cycle in networks., , и . Discret. Appl. Math., (2018)Optimal Deterministic Controller Synthesis from Steady-State Distributions., , , , и . J. Autom. Reason., 67 (1): 7 (марта 2023)Reachability problems in interval-constrained and cardinality-constrained graphs., , и . Discret. Math. Algorithms Appl., 15 (4): 2250110:1-2250110:26 (мая 2023)Algorithmic Analysis of Priority-Based Bin Packing., , , и . CALDAM, том 12601 из Lecture Notes in Computer Science, стр. 359-372. Springer, (2021)On the Approximability of Path and Cycle Problems in Arc-Dependent Networks., , , и . CALDAM, том 13179 из Lecture Notes in Computer Science, стр. 292-304. Springer, (2022)New Results on Test-Cost Minimization in Database Migration., , , и . ALGOCLOUD, том 13084 из Lecture Notes in Computer Science, стр. 38-55. Springer, (2021)Analyzing the 3-path Vertex Cover Problem in Planar Bipartite Graphs., и . TAMC, том 13571 из Lecture Notes in Computer Science, стр. 103-115. Springer, (2022)On the Parallel Complexity of Constrained Read-Once Refutations in UTVPI Constraint Systems., и . TAMC, том 13571 из Lecture Notes in Computer Science, стр. 293-304. Springer, (2022)Constrained read-once refutations in UTVPI constraint systems: A parallel perspective., и . Math. Struct. Comput. Sci., 34 (3): 227-243 (2024)