EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues RAIRO-Theor. Inf. Appl., 30 1 (1996) 1-21 Article references

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):

Space-Bounded Quantum Complexity

John Watrous
Journal of Computer and System Sciences 59 (2) 281 (1999)
DOI: 10.1006/jcss.1999.1655
See this article

Algorithms and Computation

Andreas Jakoby and Maciej Liśkiewicz
Lecture Notes in Computer Science, Algorithms and Computation 2223 562 (2001)
DOI: 10.1007/3-540-45678-3_48
See this article

On the Hardness of Graph Isomorphism

Jacobo Torán
SIAM Journal on Computing 33 (5) 1093 (2004)
DOI: 10.1137/S009753970241096X
See this article

J. Goldsmith and M. Mundhenk
272 (1998)
DOI: 10.1109/CCC.1998.694621
See this article

Thanh Minh Hoang and T. Thierauf
28 (2005)
DOI: 10.1109/CCC.2005.28
See this article

C. Damm, M. Holzer and P. McKenzie
70 (2000)
DOI: 10.1109/CCC.2000.856737
See this article

K. Reinhardt and E. Allender
244 (1997)
DOI: 10.1109/SFCS.1997.646113
See this article

Martin Grohe and Wied Pakusa
1 (2017)
DOI: 10.1109/LICS.2017.8005081
See this article

V. Arvind and T.C. Vijayaraghavan
204 (2004)
DOI: 10.1109/CCC.2004.1313844
See this article

Encyclopedia of Complexity and Systems Science

John Watrous
Encyclopedia of Complexity and Systems Science 1 (2013)
DOI: 10.1007/978-3-642-27737-5_428-3
See this article

On TC0, AC0, and Arithmetic Circuits

Manindra Agrawal, Eric Allender and Samir Datta
Journal of Computer and System Sciences 60 (2) 395 (2000)
DOI: 10.1006/jcss.1999.1675
See this article

Computational Complexity

John Watrous
Computational Complexity 2361 (2012)
DOI: 10.1007/978-1-4614-1800-9_147
See this article

Perspectives in Computational Complexity

Vikraman Arvind
Perspectives in Computational Complexity 1 (2014)
DOI: 10.1007/978-3-319-05446-9_1
See this article

Computer Science – Theory and Applications

Mikhail N. Vyalyi
Lecture Notes in Computer Science, Computer Science – Theory and Applications 7913 271 (2013)
DOI: 10.1007/978-3-642-38536-0_24
See this article

The Parallel Complexity of Graph Canonization Under Abelian Group Action

V. Arvind and Johannes Köbler
Algorithmica 67 (2) 247 (2013)
DOI: 10.1007/s00453-013-9805-0
See this article

On expressive power of regular realizability problems

M. N. Vyalyi
Problems of Information Transmission 49 (3) 276 (2013)
DOI: 10.1134/S0032946013030058
See this article

Mathematical Foundations of Computer Science 2010

Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas and Heribert Vollmer
Lecture Notes in Computer Science, Mathematical Foundations of Computer Science 2010 6281 306 (2010)
DOI: 10.1007/978-3-642-15155-2_28
See this article

Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds

Eric Allender, Klaus Reinhardt and Shiyu Zhou
Journal of Computer and System Sciences 59 (2) 164 (1999)
DOI: 10.1006/jcss.1999.1646
See this article

A note on closure properties of logspace MOD classes

Ulrich Hertrampf, Steffen Reith and Heribert Vollmer
Information Processing Letters 75 (3) 91 (2000)
DOI: 10.1016/S0020-0190(00)00091-0
See this article

Equivalence Problems for Circuits over Sets of Natural Numbers

Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen Travers and Matthias Waldherr
Theory of Computing Systems 46 (1) 80 (2010)
DOI: 10.1007/s00224-008-9144-8
See this article

Counting classes and the fine structure between NC1 and L

Samir Datta, Meena Mahajan, B.V. Raghavendra Rao, Michael Thomas and Heribert Vollmer
Theoretical Computer Science 417 36 (2012)
DOI: 10.1016/j.tcs.2011.05.050
See this article

Computing and Combinatorics

V. Arvind and T. C. Vijayaraghavan
Lecture Notes in Computer Science, Computing and Combinatorics 5092 160 (2008)
DOI: 10.1007/978-3-540-69733-6_17
See this article

The orbit problem is in the GapL hierarchy

V. Arvind and T. C. Vijayaraghavan
Journal of Combinatorial Optimization 21 (1) 124 (2011)
DOI: 10.1007/s10878-009-9243-8
See this article

Non-commutative arithmetic circuits: depth reduction and size lower bounds

Eric Allender, Jia Jiao, Meena Mahajan and V. Vinay
Theoretical Computer Science 209 (1-2) 47 (1998)
DOI: 10.1016/S0304-3975(97)00227-2
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 Toda
Theoretical Computer Science 304 (1-3) 129 (2003)
DOI: 10.1016/S0304-3975(03)00080-X
See this article

New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems

Eric Allender and Shuichi Hirahara
ACM Transactions on Computation Theory 11 (4) 1 (2019)
DOI: 10.1145/3349616
See this article

Guest column: A panorama of counting problems the decision version of which is in P 3

Eleni Bakali, Aggeliki Chalki, Andreas Göbel, Aris Pagourtzis and Stathis Zachos
ACM SIGACT News 53 (3) 46 (2022)
DOI: 10.1145/3561064.3561072
See this article

Making Nondeterminism Unambiguous

Klaus Reinhardt and Eric Allender
SIAM Journal on Computing 29 (4) 1118 (2000)
DOI: 10.1137/S0097539798339041
See this article

Guest Column

Eric Allender
ACM SIGACT News 54 (1) 63 (2023)
DOI: 10.1145/3586165.3586175
See this article

Encyclopedia of Complexity and Systems Science

John Watrous
Encyclopedia of Complexity and Systems Science 7174 (2009)
DOI: 10.1007/978-0-387-30440-3_428
See this article

Amplifying lower bounds by means of self-reducibility

Eric Allender and Michal Koucký
Journal of the ACM 57 (3) 1 (2010)
DOI: 10.1145/1706591.1706594
See this article

ON THE MINIMAL POLYNOMIAL OF A MATRIX

THANH MINH HOANG and THOMAS THIERAUF
International Journal of Foundations of Computer Science 15 (01) 89 (2004)
DOI: 10.1142/S0129054104002327
See this article

Asymptotic Perturbation Bounds for Probabilistic Model Checking with Empirically Determined Probability Parameters

Guoxin Su, Yuan Feng, Taolue Chen and David S. Rosenblum
IEEE Transactions on Software Engineering 42 (7) 623 (2016)
DOI: 10.1109/TSE.2015.2508444
See this article

Computing and Combinatorics

V. Arvind and Johannes Köbler
Lecture Notes in Computer Science, Computing and Combinatorics 6842 444 (2011)
DOI: 10.1007/978-3-642-22685-4_39
See this article

Emptiness problems for integer circuits

Dominik Barth, Moritz Beck, Titus Dose, et al.
Theoretical Computer Science 824-825 11 (2020)
DOI: 10.1016/j.tcs.2020.03.023
See this article

Complexity of finite-horizon Markov decision process problems

Martin Mundhenk, Judy Goldsmith, Christopher Lusena and Eric Allender
Journal of the ACM 47 (4) 681 (2000)
DOI: 10.1145/347476.347480
See this article

Computer Science Logic

Stephen Cook and Lila Fontes
Lecture Notes in Computer Science, Computer Science Logic 6247 245 (2010)
DOI: 10.1007/978-3-642-15205-4_21
See this article

Mathematical Foundations of Computer Science 2003

Hubie Chen
Lecture Notes in Computer Science, Mathematical Foundations of Computer Science 2003 2747 328 (2003)
DOI: 10.1007/978-3-540-45138-9_27
See this article

E. Allender and K. Reinhardt
92 (1998)
DOI: 10.1109/CCC.1998.694594
See this article

Mathematical Foundations of Computer Science 2007

Fabian Wagner
Lecture Notes in Computer Science, Mathematical Foundations of Computer Science 2007 4708 572 (2007)
DOI: 10.1007/978-3-540-74456-6_51
See this article

Mathematical Foundations of Computer Science 1997

Martin Mundhenk, Judy Goldsmith and Eric Allender
Lecture Notes in Computer Science, Mathematical Foundations of Computer Science 1997 1295 129 (1997)
DOI: 10.1007/BFb0029956
See this article

SIGACT News complexity theory column 41

Lane A. Hemaspaandra
ACM SIGACT News 34 (3) 26 (2003)
DOI: 10.1145/945526.945535
See this article

Computing and Combinatorics

Thanh Minh Hoang and Thomas Thierauf
Lecture Notes in Computer Science, Computing and Combinatorics 2387 37 (2002)
DOI: 10.1007/3-540-45655-4_6
See this article

On the complexity of the multivariate resultant

Bruno Grenet, Pascal Koiran and Natacha Portier
Journal of Complexity 29 (2) 142 (2013)
DOI: 10.1016/j.jco.2012.10.001
See this article

Bill Fefferman and Zachary Remscrim
1343 (2021)
DOI: 10.1145/3406325.3451051
See this article

FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science

Thanh Minh Hoang and Thomas Thierauf
Lecture Notes in Computer Science, FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science 2556 206 (2002)
DOI: 10.1007/3-540-36206-1_19
See this article

Foundations of Information Technology in the Era of Network and Mobile Computing

Alina Beygelzimer and Mitsunori Ogihara
Foundations of Information Technology in the Era of Network and Mobile Computing 59 (2002)
DOI: 10.1007/978-0-387-35608-2_6
See this article

V. Arvind, P.P. Kurur and T.C. Vijayaraghavan
13 (2005)
DOI: 10.1109/CCC.2005.7
See this article

On the Complexity of Matrix Rank and Rigidity

Meena Mahajan and Jayalal M. N. Sarma
Theory of Computing Systems 46 (1) 9 (2010)
DOI: 10.1007/s00224-008-9136-8
See this article