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

Bounded queries to SAT and the Boolean hierarchy

Richard Beigel
Theoretical Computer Science 84 (2) 199 (1991)
DOI: 10.1016/0304-3975(91)90160-4
See this article

Exact complexity of Exact-Four-Colorability

Jörg Rothe
Information Processing Letters 87 (1) 7 (2003)
DOI: 10.1016/S0020-0190(03)00229-1
See this article

Probabilistic polynomial time is closed under parity reductions

Richard Beigel, Lane A. Hemachandra and Gerd Wechsung
Information Processing Letters 37 (2) 91 (1991)
DOI: 10.1016/0020-0190(91)90140-D
See this article

The boolean hierarchy of NP-partitions

Sven Kosub and Klaus W. Wagner
Information and Computation 206 (5) 538 (2008)
DOI: 10.1016/j.ic.2007.06.003
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

Oracles That Compute Values

Stephen Fenner, Steven Homer, Mitsunori Ogihara and Alan Selman
SIAM Journal on Computing 26 (4) 1043 (1997)
DOI: 10.1137/S0097539793247439
See this article

On adaptive versus nonadaptive bounded query machines

Ker-I Ko
Theoretical Computer Science 82 (1) 51 (1991)
DOI: 10.1016/0304-3975(91)90171-W
See this article

Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP

Edith Hemaspaandra and Jörg Rothe
Information Processing Letters 65 (3) 151 (1998)
DOI: 10.1016/S0020-0190(97)00219-6
See this article

The complexity of unions of disjoint sets

Christian Glaßer, Alan L. Selman, Stephen Travers and Klaus W. Wagner
Journal of Computer and System Sciences 74 (7) 1173 (2008)
DOI: 10.1016/j.jcss.2008.05.001
See this article


International Journal of Foundations of Computer Science 19 (03) 649 (2008)
DOI: 10.1142/S0129054108005875
See this article

Efficient algorithms for membership in boolean hierarchies of regular languages

Christian Glaßer, Heinz Schmitz and Victor Selivanov
Theoretical Computer Science 646 86 (2016)
DOI: 10.1016/j.tcs.2016.07.017
See this article

A Downward Collapse within the Polynomial Hierarchy

Edith Hemaspaandra, Lane A. Hemaspaandra and Harald Hempel
SIAM Journal on Computing 28 (2) 383 (1998)
DOI: 10.1137/S0097539796306474
See this article

Complexity-Restricted Advice Functions

Johannes Köbler and Thomas Thierauf
SIAM Journal on Computing 23 (2) 261 (1994)
DOI: 10.1137/S0097539791200351
See this article

Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games

Anja Rey, Jörg Rothe, Hilmar Schadrack and Lena Schend
Annals of Mathematics and Artificial Intelligence 77 (3-4) 317 (2016)
DOI: 10.1007/s10472-015-9461-y
See this article

Mind change speed-up for learning languages from positive data

Sanjay Jain and Efim Kinber
Theoretical Computer Science 489-490 37 (2013)
DOI: 10.1016/j.tcs.2013.04.009
See this article

Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets

Lane A. Hemaspaandra and Jörg Rothe
SIAM Journal on Computing 26 (3) 634 (1997)
DOI: 10.1137/S0097539794261970
See this article

Error-bounded probabilistic computations between MA and AM

Elmar Böhler, Christian Glaßer and Daniel Meister
Journal of Computer and System Sciences 72 (6) 1043 (2006)
DOI: 10.1016/j.jcss.2006.05.001
See this article

The Complexity of Computing Minimal Unidirectional Covering Sets

Dorothea Baumeister, Felix Brandt, Felix Fischer, Jan Hoffmann and Jörg Rothe
Theory of Computing Systems 53 (3) 467 (2013)
DOI: 10.1007/s00224-012-9437-9
See this article

Query Order

Lane A. Hemaspaandra, Harald Hempel and Gerd Wechsung
SIAM Journal on Computing 28 (2) 637 (1998)
DOI: 10.1137/S0097539796297632
See this article

Fine hierarchies via Priestley duality

Victor Selivanov
Annals of Pure and Applied Logic 163 (8) 1075 (2012)
DOI: 10.1016/j.apal.2011.12.029
See this article

On Sets Truth-Table Reducible to Sparse Sets

Ronald V. Book and Ker-I Ko
SIAM Journal on Computing 17 (5) 903 (1988)
DOI: 10.1137/0217056
See this article

Extending Downward Collapse from 1-versus-2 Queries to m-versus-m + 1 Queries

Edith Hemaspaandra, Lane A. Hemaspaandra and Harald Hempel
SIAM Journal on Computing 34 (6) 1352 (2005)
DOI: 10.1137/S0097539701391002
See this article

A note on parallel queries and the symmetric-difference hierarchy

Klaus W. Wagner
Information Processing Letters 66 (1) 13 (1998)
DOI: 10.1016/S0020-0190(98)00024-6
See this article

On boolean lowness and boolean highness

Steffen Reith and Klaus W. Wagner
Theoretical Computer Science 261 (2) 305 (2001)
DOI: 10.1016/S0304-3975(00)00146-8
See this article

Fine hierarchies and m-reducibilities in theoretical computer science

Victor L. Selivanov
Theoretical Computer Science 405 (1-2) 116 (2008)
DOI: 10.1016/j.tcs.2008.06.031
See this article

The structure of logarithmic advice complexity classes

JoséL. Balcázar and Montserrat Hermo
Theoretical Computer Science 207 (1) 217 (1998)
DOI: 10.1016/S0304-3975(98)00066-8
See this article

A taxonomy of complexity classes of functions

Alan L. Selman
Journal of Computer and System Sciences 48 (2) 357 (1994)
DOI: 10.1016/S0022-0000(05)80009-1
See this article