The complexity of game isomorphism. (English)
Theor. Comput. Sci. 412, No. 48, 6675-6695 (2011).
1
Hat guessing games. (English)
SIAM J. Discrete Math. 22, No. 2, 592-605 (2008).
2
A combinatorial characterization of resolution width. (English)
J. Comput. Syst. Sci. 74, No. 3, 323-334 (2008).
3
The least square values and the Shapley value for cooperative TU games. (English)
Top 14, No. 1, 61-73 (2006).
4
Criteria for repetition-freeness of functions in the algebra of logic. (English)
Sov. Math., Dokl. 43, No.3, 721-726 (1991); translation from Dokl. Akad. Nauk SSSR 318, No.3, 532-537 (1991).
5
Applied combinatorics. 2nd ed. (English)
New York - Chichester etc.: John Wiley \& Sons. XI, 447. p. \sterling 40.50 (1984).
6
Applied combinatorics. (English)
New York etc.: John Wiley \& Sons. IX, 385 p. \sterling 10.50 (1980).
7
Sentences with three quantifiers are decidable in set theory. (English)
Fundam. Math. 102, 1-8 (1979).
8
Start
Contact
Print
General Help
