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:

Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity

Toniann Pitassi, Morgan Shirley and Thomas Watson
computational complexity 30 (2) (2021)
https://doi.org/10.1007/s00037-021-00210-5

Acceptance in incomplete argumentation frameworks

Dorothea Baumeister, Matti Järvisalo, Daniel Neugebauer, Andreas Niskanen and Jörg Rothe
Artificial Intelligence 295 103470 (2021)
https://doi.org/10.1016/j.artint.2021.103470

Efficient algorithms for membership in boolean hierarchies of regular languages

Christian Glaßer, Heinz Schmitz and Victor Selivanov
Theoretical Computer Science 646 86 (2016)
https://doi.org/10.1016/j.tcs.2016.07.017

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)
https://doi.org/10.1007/s10472-015-9461-y

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)
https://doi.org/10.1007/s00224-012-9437-9

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)
https://doi.org/10.1016/j.tcs.2011.05.050

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)
https://doi.org/10.1007/978-3-642-15155-2_28

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)
https://doi.org/10.1016/j.jcss.2008.05.001

Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP

Edith Hemaspaandra, Jörg Rothe and Holger Spakowski
RAIRO - Theoretical Informatics and Applications 40 (1) 75 (2006)
https://doi.org/10.1051/ita:2005041

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)
https://doi.org/10.1016/j.jcss.2006.05.001

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

Edith Hemaspaandra, Lane A. Hemaspaandra and Harald Hempel
SIAM Journal on Computing 34 (6) 1352 (2005)
https://doi.org/10.1137/S0097539701391002

Discrete Mathematics and Theoretical Computer Science

Sven Kosub
Lecture Notes in Computer Science, Discrete Mathematics and Theoretical Computer Science 2731 225 (2003)
https://doi.org/10.1007/3-540-45066-1_18

Optimal Series-Parallel Trade-offs for Reducing a Function to Its Own Graph

Richard Beigel, Lane A. Hemaspaandra, Harald Hempel and Jörg Vogel
Information and Computation 173 (2) 123 (2002)
https://doi.org/10.1006/inco.2001.3072

Mathematical Foundations of Computer Science 2000

Sven Kosub
Lecture Notes in Computer Science, Mathematical Foundations of Computer Science 2000 1893 467 (2000)
https://doi.org/10.1007/3-540-44612-5_42

Mathematical Foundations of Computer Science 2000

Edith Hemaspaandra and Lane A. Hemaspaandra
Lecture Notes in Computer Science, Mathematical Foundations of Computer Science 2000 1893 64 (2000)
https://doi.org/10.1007/3-540-44612-5_5

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)
https://doi.org/10.1016/S0020-0190(97)00219-6

Algorithms and Complexity

Edith Hemaspaandra, Lane A. Hemaspaandra and Harald Hempel
Lecture Notes in Computer Science, Algorithms and Complexity 1203 49 (1997)
https://doi.org/10.1007/3-540-62592-5_60

Automata, Languages and Programming

Edith Hemaspaandra, Lane A. Hemaspaandra and Jörg Rothe
Lecture Notes in Computer Science, Automata, Languages and Programming 1256 214 (1997)
https://doi.org/10.1007/3-540-63165-8_179

Fundamentals of Computation Theory

Edith Hemaspaandra, Lane A. Hemaspaandra and Harald Hempel
Lecture Notes in Computer Science, Fundamentals of Computation Theory 1279 222 (1997)
https://doi.org/10.1007/BFb0036186

Upper bounds for the complexity of sparse and tally descriptions

V. Arvind, J. Köbler and M. Mundhenk
Mathematical Systems Theory 29 (1) 63 (1996)
https://doi.org/10.1007/BF01201814

Generalized theorems on relationships among reducibility notions to certain complexity classes

Mitsunori Ogiwara
Mathematical Systems Theory 27 (3) 189 (1994)
https://doi.org/10.1007/BF01578841

A relationship between difference hierarchies and relativized polynomial hierarchies

Richard Beigel, Richard Chang and Mitsunori Ogiwara
Mathematical Systems Theory 26 (3) 293 (1993)
https://doi.org/10.1007/BF01371729

Bounded query classes and the difference hierarchy

Richard Beigel, William I. Gasarch and Louise Hay
Archive for Mathematical Logic 29 (2) 69 (1989)
https://doi.org/10.1007/BF01620618