On winning Ehrenfeucht games and monadic NP

被引：0
|
作者：
Schwentick, T.
机构：
来源：
Bulletin of the European Association for Theoretical Computer Science | 1995年 / 56期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] On winning Ehrenfeucht games and monadic NP
    Schwentick, T
    ANNALS OF PURE AND APPLIED LOGIC, 1996, 79 (01) : 61 - 92
  • [2] On winning strategies in Ehrenfeucht-Fraisse games
    Arora, S
    Fagin, R
    THEORETICAL COMPUTER SCIENCE, 1997, 174 (1-2) : 97 - 121
  • [3] Ehrenfeucht games, the composition method, and the monadic theory of ordinal words
    Thomas, W
    STRUCTURES IN LOGIC AND COMPUTER SCIENCE, 1997, 1261 : 118 - 143
  • [4] ON MONADIC NP VS MONADIC CO-NP
    FAGIN, R
    STOCKMEYER, LJ
    VARDI, MY
    INFORMATION AND COMPUTATION, 1995, 120 (01) : 78 - 92
  • [5] The closure of monadic NP
    Ajtai, M
    Fagin, R
    Stockmeyer, L
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2000, 60 (03) : 660 - 716
  • [6] Ehrenfeucht games and ordinal addition
    Maurin, F
    ANNALS OF PURE AND APPLIED LOGIC, 1997, 89 (01) : 53 - 73
  • [7] Trees and Ehrenfeucht-Fraisse games
    Todorcevic, S
    Väänänen, J
    ANNALS OF PURE AND APPLIED LOGIC, 1999, 100 (1-3) : 69 - 97
  • [8] Ehrenfeucht-Fraisse games on ordinals
    Mwesigye, F.
    Truss, J. K.
    ANNALS OF PURE AND APPLIED LOGIC, 2018, 169 (07) : 616 - 636
  • [9] On complexity of Ehrenfeucht-Fraisse games
    Khoussainov, Bakhadyr
    Liu, Jiamou
    ANNALS OF PURE AND APPLIED LOGIC, 2009, 161 (03) : 404 - 415
  • [10] Ehrenfeucht games and paraconsistent annotated logics
    Scalzitti, A
    Abe, JM
    7TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL XII, PROCEEDINGS: INFORMATION SYSTEMS, TECHNOLOGIES AND APPLICATIONS: II, 2003, : 224 - 228
12345