ON THE COMPUTATIONAL-COMPLEXITY OF BISIMULATION

被引：4

|

作者：

MOLLER, F ^{[1
]}

SMOLKA, SA ^{[1
]}

机构：

[1] SUNY STONY BROOK,STONY BROOK,NY 11794

来源：

ACM COMPUTING SURVEYS | 1995年 / 27卷 / 02期

关键词：

D O I：

10.1145/210376.210406

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

[No abstract available]

引用

收藏

页码：287 / 289

页数：3

相关论文

共 50 条

[1] AN OVERVIEW OF COMPUTATIONAL-COMPLEXITY
COOK, SA
[J]. COMMUNICATIONS OF THE ACM, 1983, 26 (06) : 401 - 408
[2] AMORTIZED COMPUTATIONAL-COMPLEXITY
TARJAN, RE
[J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1985, 6 (02): : 306 - 318
[3] THE COMPUTATIONAL-COMPLEXITY OF ABDUCTION
BYLANDER, T
ALLEMANG, D
TANNER, MC
JOSEPHSON, JR
[J]. ARTIFICIAL INTELLIGENCE, 1991, 49 (1-3) : 25 - 60
[4] On the computational complexity of bisimulation, redux
Moller, F
Smolka, S
Srba, J
[J]. INFORMATION AND COMPUTATION, 2004, 194 (02) : 129 - 143
[5] THE COMPUTATIONAL-COMPLEXITY OF WRITING SYSTEMS
SIMONS, GF
[J]. FIFTEENTH LACUS FORUM 1988, 1989, : 538 - 553
[6] ON COMPUTATIONAL-COMPLEXITY OF PROLOG PROGRAMS
DIKOVSKY, AJ
[J]. THEORETICAL COMPUTER SCIENCE, 1993, 119 (01) : 63 - 102
[7] ON THE COMPUTATIONAL-COMPLEXITY OF SMALL DESCRIPTIONS
GAVALDA, R
WATANABE, O
[J]. SIAM JOURNAL ON COMPUTING, 1993, 22 (06) : 1257 - 1275
[8] ON THE COMPUTATIONAL-COMPLEXITY OF A RIGIDITY PROBLEM
MANSFIELD, A
[J]. IMA JOURNAL OF APPLIED MATHEMATICS, 1981, 27 (04) : 423 - 429
[9] LOGICAL SYNTAX AND COMPUTATIONAL-COMPLEXITY
DENENBERG, L
LEWIS, HR
[J]. LECTURE NOTES IN MATHEMATICS, 1984, 1104 : 101 - 115
[10] COMPUTATIONAL-COMPLEXITY OF MATROID PROPERTIES
ROBINSON, GC
WELSH, DJA
[J]. MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1980, 87 (JAN) : 29 - 45

← 1 2 3 4 5 →