THE CHECKERS PROBLEM - A SOLUTION WITH LINEAR-TIME COMPLEXITY

被引：0
|
作者：
TRAUNMULLER, K
机构：
来源：
SIGPLAN NOTICES | 1995年 / 30卷 / 09期
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：25 / 32
页数：8
相关论文
共 50 条
  • [1] Calculating a linear-time solution to the densest-segment problem
    Curtis, Sharon
    Mu, Shin-Cheng
    JOURNAL OF FUNCTIONAL PROGRAMMING, 2015, 25
  • [2] On the complexity of the linear-time μ-calculus for Petri Nets
    Habermehl, P
    APPLICATION AND THEORY OF PETRI NETS 1997, 1997, 1248 : 102 - 116
  • [3] A linear-time solution to the knapsack problem using P systems with active membranes
    Pérez-Jiménez, MJ
    Riscos-Núñez, A
    MEMBRANE COMPUTING, 2004, 2933 : 250 - 268
  • [4] A Linear-Time Solution for All-SAT Problem Based on P System
    GUO Ping
    ZHU Jian
    CHEN Haizhu
    YANG Ruilong
    Chinese Journal of Electronics, 2018, 27 (02) : 367 - 373
  • [5] A Linear-Time Solution for All-SAT Problem Based on P System
    Guo Ping
    Zhu Jian
    Chen Haizhu
    Yang Ruilong
    CHINESE JOURNAL OF ELECTRONICS, 2018, 27 (02) : 367 - 373
  • [6] Complexity and succinctness issues for linear-time hybrid logics
    Bozzelli, Laura
    Lanotte, Ruggero
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (02) : 454 - 469
  • [7] A linear-time algorithm for computing the multinomial stochastic complexity
    Kontkanen, Petri
    Myllymaki, Petri
    INFORMATION PROCESSING LETTERS, 2007, 103 (06) : 227 - 233
  • [8] The complexity of counting models of linear-time temporal logic
    Hazem Torfah
    Martin Zimmermann
    Acta Informatica, 2018, 55 : 191 - 212
  • [9] The Complexity of Linear-Time Temporal Logic Model Repair
    Tao, Xiuting
    Li, Guoqiang
    STRUCTURED OBJECT-ORIENTED FORMAL LANGUAGE AND METHOD, SOFL+MSVL 2017, 2018, 10795 : 69 - 87
  • [10] Complexity and Succinctness Issues for Linear-Time Hybrid Logics
    Bozzelli, Laura
    Lanotte, Ruggero
    LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2008, 5293 : 48 - 61
12345