The Complexity of Planarity Testing (2000)

by Eric Allender , Meena Mahajan
Citations:23 - 7 self

Active Bibliography

2 Complexity Classes – Eric Allender, Michael C. Loui, Kenneth W. Regan - 1998
Constrained Planarity • Deletion and Partition Problems • – Maurizio Patrignani, Upward Planarity Outerplanarity
11 A Short History of Computational Complexity – Lance Fortnow, Steve Homer - 2002
Alternative notions of approximation and space-bounded computations – Alina Beygelzimer - 2003
6 Fully Dynamic Planarity Testing with Applications – Zvi Galil, et al.
1 Planarity Testing and Embedding – Pier Francesco Cortese, Maurizio Patrignani - 2004
26 Symmetric Logspace is Closed Under Complement – Noam Nisan, Amnon Ta-Shma - 1994
15 An Unambiguous Class Possessing a Complete Set – Klaus-Jörn Lange - 1996
Deterministic Simulations and Hierarchy . . . – Jeffrey J. Kinne - 2010
U.C. Berkeley — CS172: Automata, Computability and Complexity Handout 6 Professor Luca Trevisan 4/13/2004 – unknown authors
The Computational Complexity Column – Lance Fortnow Nec, Lance Fortnow, Lance Fortnow, Steve Homer
Notes on Space-Bounded Complexity – unknown authors - 2009
19 The Complexity of Reconfiguring Network Models – Y. Ben-asher, K. -j. Lange, D. Peleg, A. Schuster - 1992
36 Randomization and Derandomization in Space-Bounded Computation – Michael Saks - 1996
1 My Favorite Ten Complexity Theorems of the Past Decade – Lance Fortnow
15 Directed planar reachability is in unambiguous logspace – Chris Bourke, Raghunath Tewari, N. V. Vinodchandran - 2007
5 Sparse Hard Sets for P: Resolution of a Conjecture of Hartmanis – Jin-yi Cai, D. Sivakumar
4 Some observations about relativization of space bounded computations – Juris Hartmanis, Richard Chang, Jim Kadin, Stephen G. Mitchell - 1988
3 Space Hierarchy Results for Randomized and Other Semantic Models – Jeff Kinne, Dieter Melkebeek - 2007