( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Analyzing the Reachability Problem in Choice Networks.

, , и . CPAIOR, том 13292 из Lecture Notes in Computer Science, стр. 408-423. Springer, (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.

Aman K K Bhasin

K Kusterer

K Böhm

K Beheng

K Schweizerhof

 

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

Differentiable Discrete Optimization Using Dataless Neural Networks., , и . COCOA (2), том 14462 из Lecture Notes in Computer Science, стр. 3-15. Springer, (2023)An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints., , , и . AAIM, том 11343 из Lecture Notes in Computer Science, стр. 111-123. Springer, (2018)A Graphical Theorem of the Alternative for UTVPI Constraints., и . ICTAC, том 9399 из Lecture Notes in Computer Science, стр. 328-345. Springer, (2015)Analyzing Selected Quantified Integer Programs.. IJCAR, том 3097 из Lecture Notes in Computer Science, стр. 342-356. Springer, (2004)A Randomized Algorithm for BBCSPs in the Prover-Verifier Model.. ICTAC, том 4711 из Lecture Notes in Computer Science, стр. 455-466. Springer, (2007)Algorithmic Aspects of Risk Management., , и . Formal Modeling: Actors, Open Systems, Biological Systems, том 7000 из Lecture Notes in Computer Science, стр. 262-276. Springer, (2011)On the Complexities of Selected Satisfiability and Equivalence Queries over Boolean Formulas and Inclusion Queries over Hulls.. Adv. Decis. Sci., (2009)Absorbing random walks and the NAE2SAT problem., и . Int. J. Comput. Math., 88 (3): 452-467 (2011)Boolean Functions as Models for Quantified Boolean Formulas., , и . J. Autom. Reason., 39 (1): 49-75 (2007)On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection., и . Appl. Math. Comput., 173 (1): 273-305 (2006)