( en | de | ru )

 

Disambiguation of "Hermann, Miki"

Author of the publication

copydeleteadd this publication to your clipboard
Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics.

, , , and . ISMVL, page 100-105. IEEE Computer Society, (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

On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations., and . MFCS, volume 1450 of Lecture Notes in Computer Science, page 257-266. Springer, (1998)Trichotomy in the Complexity of Minimal Inference., , and . LICS, page 387-396. IEEE Computer Society, (2009)Counting Partitions of Graphs., , and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 227-236. Springer, (2012)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)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)On Proving Properties of Completion Strategies.. RTA, volume 488 of Lecture Notes in Computer Science, page 398-410. Springer, (1991)On the complexity of generalized chromatic polynomials., , , , and . CoRR, (2017)On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups., and . CP, volume 1330 of Lecture Notes in Computer Science, page 282-296. Springer, (1997)The Complexity of Counting Problems in Equational Matching., and . CADE, volume 814 of Lecture Notes in Computer Science, page 560-574. Springer, (1994)