Exhausting strategies, joker games and full completeness for IMLL with Unit

Author： Murawski A.S.   Ong C.-H.L.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.294, Iss.1, 2003-02, pp. : 269-305

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

NP-completeness for calculating power indices of weighted majority games

By Matsui Y.   Matsui T.  

Theoretical Computer Science, Vol. 263, Iss. 1, 2001-07 ,pp. : 305-310

Elsevier

Access to resources Recommend Favorite

Generalising Unit-Refutation Completeness and SLUR via Nested Input Resolution

By Gwynne Matthew   Kullmann Oliver  

Journal of Automated Reasoning, Vol. 52, Iss. 1, 2014-01 ,pp. : 31-65

Springer Publishing Company

Access to resources Recommend Favorite

The unit-level-core for multi-choice games: the replicated core for TU games

By Hwang Yan-An   Liao Yu-Hsien  

Journal of Global Optimization, Vol. 47, Iss. 2, 2010-06 ,pp. : 161-171

Springer Publishing Company

Access to resources Recommend Favorite

On winning strategies in Ehrenfeucht-Fraisse games

By Arora S.   Fagin R.  

Theoretical Computer Science, Vol. 174, Iss. 1, 1997-03 ,pp. : 97-121

Elsevier

Access to resources Recommend Favorite

On determining optimal strategies in pursuit games in the plane

By Le N.-M.  

Theoretical Computer Science, Vol. 197, Iss. 1, 1998-05 ,pp. : 203-234

Elsevier

Access to resources Recommend Favorite