Green's theorem and isolation in planar graphs
暂无分享,去创建一个
[1] Eric Allender,et al. Planar and Grid Graph Reachability Problems , 2009, Theory of Computing Systems.
[2] Philippe Chassaing,et al. The average complexity of a coin-weighing problem , 1996 .
[3] Eric Allender,et al. Uniform constant-depth threshold circuits for division and iterated multiplication , 2002, J. Comput. Syst. Sci..
[4] Eric Allender,et al. Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds , 1999, J. Comput. Syst. Sci..
[5] Walter Schnyder,et al. Embedding planar graphs on the grid , 1990, SODA '90.
[6] Andrew M. Gleason,et al. Calculus 6th ed. , 2013 .
[7] J. Reif,et al. On Threshold Circuits and Polynomial Computation , 1992, SIAM J. Comput..
[8] Raghunath Tewari,et al. Directed Planar Reachability is in Unambiguous Log-Space , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).
[9] Omer Reingold,et al. Undirected connectivity in log-space , 2008, JACM.
[10] Avi Wigderson,et al. Boolean complexity classes vs. their arithmetic analogs , 1996 .
[11] In-kyeong Choi. On straight line representations of random planar graphs , 1992 .
[12] Vijay V. Vazirani,et al. Matching is as easy as matrix inversion , 1987, STOC.
[13] Cheng-Shang Chang. Calculus , 2020, Bicycle or Unicycle?.
[14] Eric Allender,et al. Making Nondeterminism Unambiguous , 2000, SIAM J. Comput..
[15] János Pach,et al. How to draw a planar graph on a grid , 1990, Comb..
[16] Avi Wigderson,et al. Boolean complexity classes vs. their arithmetic analogs , 1996, Random Struct. Algorithms.
[17] Raghav Kulkarni,et al. Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs , 2009, Theory of Computing Systems.
[18] Vikraman Arvind,et al. Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size , 2008, APPROX-RANDOM.
[19] Sergey Yekhanin,et al. Towards 3-query locally decodable codes of subexponential length , 2008, JACM.