Relationships among $PL$, $\#L$, and the determinant
RAIRO-Theor. Inf. Appl., 30 1 (1996) 1-21
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
On the Hardness of Graph Isomorphism
Jacobo ToránSIAM Journal on Computing 33 (5) 1093 (2004)
DOI: 10.1137/S009753970241096X
See this article
On the complexity of the multivariate resultant
Bruno Grenet, Pascal Koiran and Natacha PortierJournal of Complexity 29 (2) 142 (2013)
DOI: 10.1016/j.jco.2012.10.001
See this article
Non-commutative arithmetic circuits: depth reduction and size lower bounds
Eric Allender, Jia Jiao, Meena Mahajan and V. VinayTheoretical Computer Science 209 (1-2) 47 (1998)
DOI: 10.1016/S0304-3975(97)00227-2
See this article
On TC0, AC0, and Arithmetic Circuits
Manindra Agrawal, Eric Allender and Samir DattaJournal of Computer and System Sciences 60 (2) 395 (2000)
DOI: 10.1006/jcss.1999.1675
See this article
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes
Maciej Liśkiewicz, Mitsunori Ogihara and Seinosuke TodaTheoretical Computer Science 304 (1-3) 129 (2003)
DOI: 10.1016/S0304-3975(03)00080-X
See this article
Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds
Eric Allender, Klaus Reinhardt and Shiyu ZhouJournal of Computer and System Sciences 59 (2) 164 (1999)
DOI: 10.1006/jcss.1999.1646
See this article
Space-Bounded Quantum Complexity
John WatrousJournal of Computer and System Sciences 59 (2) 281 (1999)
DOI: 10.1006/jcss.1999.1655
See this article
A note on closure properties of logspace MOD classes
Ulrich Hertrampf, Steffen Reith and Heribert VollmerInformation Processing Letters 75 (3) 91 (2000)
DOI: 10.1016/S0020-0190(00)00091-0
See this article
Counting classes and the fine structure between N C 1 L
Samir Datta, Meena Mahajan, B.V. Raghavendra Rao, Michael Thomas and Heribert VollmerTheoretical Computer Science 417 36 (2012)
DOI: 10.1016/j.tcs.2011.05.050
See this article
Algorithms and Computation
Andreas Jakoby and Maciej LiśkiewiczLecture Notes in Computer Science, Algorithms and Computation 2223 562 (2001)
DOI: 10.1007/3-540-45678-3_48
See this article
The Parallel Complexity of Graph Canonization Under Abelian Group Action
V. Arvind and Johannes KöblerAlgorithmica 67 (2) 247 (2013)
DOI: 10.1007/s00453-013-9805-0
See this article
On expressive power of regular realizability problems
M. N. VyalyiProblems of Information Transmission 49 (3) 276 (2013)
DOI: 10.1134/S0032946013030058
See this article