CONSTANT DEPTH REDUCIBILITY

[1] Aleliunas R., 1979, 20th Annual Symposium of Foundations of Computer Science, P218, DOI 10.1109/SFCS.1979.34

[2] [Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[3] Berge C., 1973, GRAPHS HYPERGRAPHS, V7

[4] RELATING TIME AND SPACE TO SIZE AND DEPTH [J]. SIAM JOURNAL ON COMPUTING, 1977, 6 (04) : 733 - 744

[5] CHANDRA AK, 1983, 15TH P ANN ACM S THE, P52

[6] Even S., 1979, GRAPH ALGORITHMS

[7] Furst M., 1981, 22nd Annual Symposium on Foundations of Computer Science, P260, DOI 10.1109/SFCS.1981.35

[8] Garey Michael R., 1979, COMPUTERS INTRACTABI

[9] A UNIVERSAL INTERCONNECTION PATTERN FOR PARALLEL COMPUTERS [J]. JOURNAL OF THE ACM, 1982, 29 (04) : 1073 - 1086

[10] ON SOME DETERMINISTIC SPACE COMPLEXITY PROBLEMS [J]. SIAM JOURNAL ON COMPUTING, 1982, 11 (03) : 591 - 601

[1] Aleliunas R., 1979, 20th Annual Symposium of Foundations of Computer Science, P218, DOI 10.1109/SFCS.1979.34

[2] [Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[3] Berge C., 1973, GRAPHS HYPERGRAPHS, V7

[4] RELATING TIME AND SPACE TO SIZE AND DEPTH [J]. SIAM JOURNAL ON COMPUTING, 1977, 6 (04) : 733 - 744

[5] CHANDRA AK, 1983, 15TH P ANN ACM S THE, P52

[6] Even S., 1979, GRAPH ALGORITHMS

[7] Furst M., 1981, 22nd Annual Symposium on Foundations of Computer Science, P260, DOI 10.1109/SFCS.1981.35

[8] Garey Michael R., 1979, COMPUTERS INTRACTABI

[9] A UNIVERSAL INTERCONNECTION PATTERN FOR PARALLEL COMPUTERS [J]. JOURNAL OF THE ACM, 1982, 29 (04) : 1073 - 1086

[10] ON SOME DETERMINISTIC SPACE COMPLEXITY PROBLEMS [J]. SIAM JOURNAL ON COMPUTING, 1982, 11 (03) : 591 - 601