The Complexity of Graph Problems fore Succinctly Represented Graphs
暂无分享,去创建一个
[1] Avi Wigderson,et al. Succinct Representations of Graphs , 1984, Inf. Control..
[2] Jacobo Torán. Succinct Representations of Counting Problems , 1988, AAECC.
[3] Uzi Vishkin,et al. Constant Depth Reducibility , 1984, SIAM J. Comput..
[4] Neil Immerman. Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..
[5] Leslie G. Valiant,et al. A complexity theory based on Boolean algebra , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[6] Antoni Lozano. NP-Hardness on succinct representation of graphs , 1988, Bull. EATCS.
[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[8] Jia-Wei Hong. On Some Deterministic Space Complexity Problems , 1982, SIAM J. Comput..
[9] Mihalis Yannakakis,et al. A Note on Succinct Representations of Graphs , 1986, Inf. Control..
[10] Christos H. Papadimitriou,et al. Symmetric Space-Bounded Computation , 1982, Theor. Comput. Sci..
[11] R. Ladner. The circuit value problem is log space complete for P , 1975, SIGA.