( en | de | ru )

 

Disambiguation of "Hermann, Miki"

Author of the publication

copydeleteadd this publication to your clipboard
Complexity of Counting the Optimal Solutions.

, and . Electron. Colloquium Comput. Complex., (2008)

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.

Miki Tsukada

ivko Miki

Nicole Mikisch

Masayuki Miki

Isao Miki

 

Other publications of authors with the same name

Chain Properties of Rule Closures.. STACS, volume 349 of Lecture Notes in Computer Science, page 339-347. Springer, (1989)On Nontermination of Knuth-Bendix Algorithm., and . ICALP, volume 226 of Lecture Notes in Computer Science, page 146-156. Springer, (1986)Trichotomies in the Complexity of Minimal Inference., , and . Theory Comput. Syst., 50 (3): 446-491 (2012)The Helly property and satisfiability of Boolean formulas defined on set families., , , and . Eur. J. Comb., 31 (2): 502-516 (2010)Complexity of Counting the Optimal Solutions., and . Electron. Colloquium Comput. Complex., (2008)Counting complexity of propositional abduction., and . J. Comput. Syst. Sci., 76 (7): 634-649 (2010)Complexity of Clausal Constraints Over Chains., , , and . Theory Comput. Syst., 42 (2): 239-255 (2008)On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System., , and . MFCS, volume 1672 of Lecture Notes in Computer Science, page 92-102. Springer, (1999)Subtractive Reductions and Complete Problems for Counting Complexity Classes., , and . MFCS, volume 1893 of Lecture Notes in Computer Science, page 323-332. Springer, (2000)Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract)., and . MFCS, volume 969 of Lecture Notes in Computer Science, page 359-370. Springer, (1995)