( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Computational Complexity of Monotone Constraint Satisfaction Problems.

, и . WALCOM, том 5431 из Lecture Notes in Computer Science, стр. 286-297. Springer, (2009)

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.

Miki Tsukada

ivko Miki

Nicole Mikisch

Isao Miki

Masayuki Miki

 

Другие публикации лиц с тем же именем

On Proving Properties of Completion Strategies.. RTA, том 488 из Lecture Notes in Computer Science, стр. 398-410. Springer, (1991)Counting Partitions of Graphs., , и . ISAAC, том 7676 из Lecture Notes in Computer Science, стр. 227-236. Springer, (2012)On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System., , и . MFCS, том 1672 из Lecture Notes in Computer Science, стр. 92-102. Springer, (1999)Subtractive Reductions and Complete Problems for Counting Complexity Classes., , и . MFCS, том 1893 из Lecture Notes in Computer Science, стр. 323-332. Springer, (2000)Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract)., и . MFCS, том 969 из Lecture Notes in Computer Science, стр. 359-370. Springer, (1995)On the complexity of generalized chromatic polynomials., , , , и . CoRR, (2017)On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations., и . MFCS, том 1450 из Lecture Notes in Computer Science, стр. 257-266. Springer, (1998)Trichotomy in the Complexity of Minimal Inference., , и . LICS, стр. 387-396. IEEE Computer Society, (2009)The Complexity of Counting Problems in Equational Matching., и . CADE, том 814 из Lecture Notes in Computer Science, стр. 560-574. Springer, (1994)On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups., и . CP, том 1330 из Lecture Notes in Computer Science, стр. 282-296. Springer, (1997)