Immunity and Simplicity for Exact Counting and Other Counting Classes
RAIRO-Theor. Inf. Appl., 33 2 (1999) 159-176
Published online: 2002-08-15
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):
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction
Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski and Osamu Watanabecomputational complexity 29 (2) (2020)
https://doi.org/10.1007/s00037-020-00197-5
Query-monotonic Turing reductions
Lane A. Hemaspaandra and Mayur ThakurTheoretical Computer Science 383 (2-3) 153 (2007)
https://doi.org/10.1016/j.tcs.2007.04.014
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
André Große, Jörg Rothe and Gerd WechsungInformation Processing Letters 99 (6) 215 (2006)
https://doi.org/10.1016/j.ipl.2006.04.007
Resource bounded immunity and simplicity
Tomoyuki Yamakami and Toshio SuzukiTheoretical Computer Science 347 (1-2) 90 (2005)
https://doi.org/10.1016/j.tcs.2005.03.055
Quantum and classical complexity classes: Separations, collapses, and closure properties
Holger Spakowski, Mayur Thakur and Rahul TripathiInformation and Computation 200 (1) 1 (2005)
https://doi.org/10.1016/j.ic.2004.10.009
Complexity Theory and Cryptology
Texts in Theoretical Computer Science An EATCS Series, Complexity Theory and Cryptology 261 (2005)https://doi.org/10.1007/3-540-28520-2_6
Complexity Theory and Cryptology
Texts in Theoretical Computer Science An EATCS Series, Complexity Theory and Cryptology 361 (2005)https://doi.org/10.1007/3-540-28520-2_8
Complexity Theory and Cryptology
Texts in Theoretical Computer Science An EATCS Series, Complexity Theory and Cryptology 171 (2005)https://doi.org/10.1007/3-540-28520-2_5
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Holger Spakowski, Mayur Thakur and Rahul TripathiLecture Notes in Computer Science, FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science 2914 375 (2003)
https://doi.org/10.1007/978-3-540-24597-1_32