THE COMPLEXITY OF COMBINATORIAL PROBLEMS WITH SUCCINCT INPUT REPRESENTATION

[1] ON COUNTING PROBLEMS AND THE POLYNOMIAL-TIME HIERARCHY [J]. THEORETICAL COMPUTER SCIENCE, 1980, 12 (02) : 161 - 173

[2] Bentley J. L., 1983, ADV COMPUTING RES, P127

[3] SUCCINCT REPRESENTATIONS OF GRAPHS [J]. INFORMATION AND CONTROL, 1983, 56 (03): : 183 - 198

[4] Garey M. R., 1979, COMPUTERS INTRACTIBI

[5] COMPUTATIONAL COMPLEXITY OF PROBABILISTIC TURING MACHINES [J]. SIAM JOURNAL ON COMPUTING, 1977, 6 (04) : 675 - 695

[6] Hartmanis J., 1983, 24th Annual Symposium on Foundations of Computer Science, P439, DOI 10.1109/SFCS.1983.21

[7] Ladner R. E., 1975, SIGACT News, V7, P18, DOI 10.1145/990518.990519

[8] BPP AND THE POLYNOMIAL HIERARCHY [J]. INFORMATION PROCESSING LETTERS, 1983, 17 (04) : 215 - 217

[9] Lengauer T., 1982, 23rd Annual Symposium on Foundations of Computer Science, P358, DOI 10.1109/SFCS.1982.92

[10] LENGAUER T, 1984, TRSFB124FB10 U SAARL

[1] ON COUNTING PROBLEMS AND THE POLYNOMIAL-TIME HIERARCHY [J]. THEORETICAL COMPUTER SCIENCE, 1980, 12 (02) : 161 - 173

[2] Bentley J. L., 1983, ADV COMPUTING RES, P127

[3] SUCCINCT REPRESENTATIONS OF GRAPHS [J]. INFORMATION AND CONTROL, 1983, 56 (03): : 183 - 198

[4] Garey M. R., 1979, COMPUTERS INTRACTIBI

[5] COMPUTATIONAL COMPLEXITY OF PROBABILISTIC TURING MACHINES [J]. SIAM JOURNAL ON COMPUTING, 1977, 6 (04) : 675 - 695

[6] Hartmanis J., 1983, 24th Annual Symposium on Foundations of Computer Science, P439, DOI 10.1109/SFCS.1983.21

[7] Ladner R. E., 1975, SIGACT News, V7, P18, DOI 10.1145/990518.990519

[8] BPP AND THE POLYNOMIAL HIERARCHY [J]. INFORMATION PROCESSING LETTERS, 1983, 17 (04) : 215 - 217

[9] Lengauer T., 1982, 23rd Annual Symposium on Foundations of Computer Science, P358, DOI 10.1109/SFCS.1982.92

[10] LENGAUER T, 1984, TRSFB124FB10 U SAARL