Succinct representations of graphs

Information and Control - Tập 56 - Trang 183-198 - 1983
Hana Galperin1, Avi Wigderson2
1Mini Systems Inc., Herzlia, Israel
2Computer Science Division, University of California, Berkeley, California 94720, USA

Tài liệu tham khảo

Aho, 1979 Cook, 1971, The complexity of theorem proving procedures, 151 Galperin, 1982, Succinct Representations of Graphs Hong, 1980, On some deterministic space complexity problems, 310 Hopcroft, 1979 Stockmeyer, 1977, The polynomial-time hierarchy, Theoret. Comput. Sci., 3, 1, 10.1016/0304-3975(76)90061-X