Author of the publication

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

A Method for Constructing Minimally Unsatisfiable CNFs.. CoRR, (2012)Some Connections Between Set Theory and Computer Science.. Kurt Gödel Colloquium, volume 713 of Lecture Notes in Computer Science, page 14-22. Springer, (1993)BREAKUP: a preprocessing algorithm for satisfiability testing of CNF formulas., and . Notre Dame J. Formal Log., 34 (4): 602-606 (1993)Two Hypergraph Theorems Equivalent to BPI.. Notre Dame J. Formal Log., 31 (2): 232-240 (1990)Deleting Edges from Ramsey Minimal Examples.. The American Mathematical Monthly, 122 (7): 681-683 (2015)A Beginner's Guide to Mathematical Logic.. The American Mathematical Monthly, 125 (2): 188-192 (2018)Generalized Davis-Putnam and satisfiability problems in mathematics.. Logic Journal of the IGPL, 18 (3): 456-463 (2010)Davis-Putnam Style Rules for Deciding Property S., and . Fundam. Informaticae, 79 (1-2): 5-15 (2007)Odd neighborhood transversals on grid graphs., , , and . Discret. Math., 307 (17-18): 2200-2208 (2007)Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency., , and . J. Graph Theory, 10 (2): 187-195 (1986)