论文信息 - STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings - 字舞流文

STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings

Neil Immerman | Kousha Etessami | N. Immerman | K. Etessami

[1] Allan Borodin,et al. Time-space tradeoffs for undirected graph traversal , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[2] Ronald Fagin,et al. Reachability is harder for directed than for undirected finite graphs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[3] Stephen A. Cook,et al. Space Lower Bounds for Maze Threadability on Restricted Machines , 1980, SIAM J. Comput..

[4] Neil Immerman,et al. Expressibility and Parallel Complexity , 1989, SIAM J. Comput..

[5] Neil Immerman. Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..

[6] Jeff Edmonds. Time-space trade-offs for undirected st-connectivity on a JAG , 1993, STOC '93.

[7] Neil Immerman,et al. An optimal lower bound on the number of variables for graph identification , 1992, Comb..

[8] Steven Lindell. A logspace algorithm for tree canonization (extended abstract) , 1992, STOC '92.

[9] H. Gaifman. On Local and Non-Local Properties , 1982 .

[10] Neil Immerman,et al. Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

[11] E. Lander,et al. Describing Graphs: A First-Order Approach to Graph Canonization , 1990 .

[12] Richard J. Lipton,et al. Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).