NONDETERMINISTIC SPACE IS CLOSED UNDER COMPLEMENTATION

[1] BORODIN A, 1987, 2 APPLICATIONS COMPL

[2] BUSS SR, UNPUB LOG SPACE ORAC

[3] A TAXONOMY OF PROBLEMS WITH FAST PARALLEL ALGORITHMS [J]. INFORMATION AND CONTROL, 1985, 64 (1-3): : 2 - 22

[4] Hartmanis J., 1974, SIAM AMS P, V7, P1

[5] Hopcroft J.E., 1979, INTRO AUTOMATA THEOR

[6] LANGUAGES THAT CAPTURE COMPLEXITY CLASSES [J]. SIAM JOURNAL ON COMPUTING, 1987, 16 (04) : 760 - 778

[7] RELATIONAL QUERIES COMPUTABLE IN POLYNOMIAL-TIME [J]. INFORMATION AND CONTROL, 1986, 68 (1-3): : 86 - 104

[8] IMMERMAN N, 1982, 14TH P ACM S THEOR C, P147

[9] IMMERMAN N, 1983, 15TH ACM S THEOR COM, P347

[10] IMMERMAN N, 1987, 2ND P C STRUCT COMPL, P194

[1] BORODIN A, 1987, 2 APPLICATIONS COMPL

[2] BUSS SR, UNPUB LOG SPACE ORAC

[3] A TAXONOMY OF PROBLEMS WITH FAST PARALLEL ALGORITHMS [J]. INFORMATION AND CONTROL, 1985, 64 (1-3): : 2 - 22

[4] Hartmanis J., 1974, SIAM AMS P, V7, P1

[5] Hopcroft J.E., 1979, INTRO AUTOMATA THEOR

[6] LANGUAGES THAT CAPTURE COMPLEXITY CLASSES [J]. SIAM JOURNAL ON COMPUTING, 1987, 16 (04) : 760 - 778

[7] RELATIONAL QUERIES COMPUTABLE IN POLYNOMIAL-TIME [J]. INFORMATION AND CONTROL, 1986, 68 (1-3): : 86 - 104

[8] IMMERMAN N, 1982, 14TH P ACM S THEOR C, P147

[9] IMMERMAN N, 1983, 15TH ACM S THEOR COM, P347

[10] IMMERMAN N, 1987, 2ND P C STRUCT COMPL, P194