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 条
  • [31] WINNING GAMES AT WORK
    BOLMER, J
    CHEMICAL ENGINEERING, 1981, 88 (13) : 99 - &
  • [32] GAMES AND WINNING STRATEGIES
    BACK, RJR
    VONWRIGHT, J
    INFORMATION PROCESSING LETTERS, 1995, 53 (03) : 165 - 172
  • [33] WINNING AT READING GAMES
    KUSIK, P
    ACADEMIC THERAPY, 1984, 19 (03): : 341 - 349
  • [34] Monadic logical definability of NP-complete problems
    Grandjean, E
    Olive, F
    COMPUTER SCIENCE LOGIC, 1995, 933 : 190 - 204
  • [35] Partially ordered connectives and monadic monotone strict NP
    Hella L.
    Sevenster M.
    Tulenheimo T.
    Journal of Logic, Language and Information, 2008, 17 (3) : 323 - 344
  • [36] AUTOMATA, GAMES, AND POSITIVE MONADIC THEORIES OF TREES
    PARIGOT, M
    LECTURE NOTES IN COMPUTER SCIENCE, 1987, 287 : 44 - 57
  • [37] EHRENFEUCHT-FRAiSSe GAMES ON A CLASS OF SCATTERED LINEAR ORDERS
    Mwesigye, Feresiano
    Truss, John Kenneth
    JOURNAL OF SYMBOLIC LOGIC, 2020, 85 (01) : 37 - 60
  • [38] Almost free groups and long Ehrenfeucht-Fraisse games
    Väisänen, P
    ANNALS OF PURE AND APPLIED LOGIC, 2003, 123 (1-3) : 101 - 134
  • [39] Circuit Lower Bounds via Ehrenfeucht-Fraisse Games
    Koucky, Michal
    Lautemann, Clemens
    Poloczek, Sebastian
    Therien, Denis
    CCC 2006: TWENTY-FIRST ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2006, : 190 - +
  • [40] THE ART OF WINNING AT BUSINESS GAMES
    OWENS, EL
    DATA MANAGEMENT, 1987, 25 (03): : 31 - 31
12345