Author of the publication

A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions.

, and . J. Algorithms, 26 (2): 291-305 (1998)

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.

 

Other publications of authors with the same name

On the Boolean Connectivity Problem for Horn Relations., , and . SAT, volume 4501 of Lecture Notes in Computer Science, page 187-200. Springer, (2007)Generating clause sequences of a CNF formula., , , , , and . CoRR, (2020)On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games., , , and . Dyn. Games Appl., 3 (2): 128-161 (2013)Locating Sources to Meet Flow Demands in Undirected Networks., , , and . J. Algorithms, 42 (1): 54-68 (2002)Approximating minimum representations of key Horn functions., , , , and . CoRR, (2018)Finding Sparse Solutions for Packing and Covering Semidefinite Programs., and . CoRR, (2018)A representation of antimatroids by Horn rules and its application to educational systems., , and . CoRR, (2015)Disjunctions of Horn Theories and Their Cores., , and . ISAAC, volume 1533 of Lecture Notes in Computer Science, page 49-58. Springer, (1998)On Disguised Double Horn Functions and Extensions., , and . STACS, volume 1373 of Lecture Notes in Computer Science, page 50-60. Springer, (1998)On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets., , , and . STACS, volume 2285 of Lecture Notes in Computer Science, page 133-141. Springer, (2002)