( en | de | ru )

 

Disambiguation of "Subramani, K."

Author of the publication

copydeleteadd this publication to your clipboard
Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints.

, , and . FAW, volume 10823 of Lecture Notes in Computer Science, page 300-314. 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. You can also use the button next to the name to display some publications already assigned to the person.

Aman K K Bhasin

Krishna-K

K Schweizerhof

K Schaber

K Beheng

 

Other publications of authors with the same name

Algorithmic Aspects of Risk Management., , and . Formal Modeling: Actors, Open Systems, Biological Systems, volume 7000 of Lecture Notes in Computer Science, page 262-276. Springer, (2011)A Randomized Algorithm for BBCSPs in the Prover-Verifier Model.. ICTAC, volume 4711 of Lecture Notes in Computer Science, page 455-466. Springer, (2007)On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection., and . Appl. Math. Comput., 173 (1): 273-305 (2006)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., and . Int. J. Comput. Math., 88 (3): 452-467 (2011)Boolean Functions as Models for Quantified Boolean Formulas., , and . J. Autom. Reason., 39 (1): 49-75 (2007)Differentiable Discrete Optimization Using Dataless Neural Networks., , and . COCOA (2), volume 14462 of Lecture Notes in Computer Science, page 3-15. Springer, (2023)A Graphical Theorem of the Alternative for UTVPI Constraints., and . ICTAC, volume 9399 of Lecture Notes in Computer Science, page 328-345. Springer, (2015)Absorbing Random Walks and the NAE2SAT Problem.. FAW, volume 5059 of Lecture Notes in Computer Science, page 89-100. Springer, (2008)Read-Once Resolutions in Horn Formulas., , and . FAW, volume 11458 of Lecture Notes in Computer Science, page 100-110. Springer, (2019)