Reducibilities on tally and sparse sets
RAIRO-Theor. Inf. Appl., 25 3 (1991) 293-302
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):
The structure of logarithmic advice complexity classes
JoséL. Balcázar and Montserrat HermoTheoretical Computer Science 207 (1) 217 (1998)
https://doi.org/10.1016/S0304-3975(98)00066-8
Advances in Algorithms, Languages, and Complexity
José L. Balcázar, Ricard Gavaldà and Osamu WatanabeAdvances in Algorithms, Languages, and Complexity 73 (1997)
https://doi.org/10.1007/978-1-4613-3394-4_3
Monotonous and randomized reductions to sparse sets
V. Arvind, J. Köbler and M. MundhenkRAIRO - Theoretical Informatics and Applications 30 (2) 155 (1996)
https://doi.org/10.1051/ita/1996300201551
Upper bounds for the complexity of sparse and tally descriptions
V. Arvind, J. Köbler and M. MundhenkMathematical Systems Theory 29 (1) 63 (1996)
https://doi.org/10.1007/BF01201814
Mathematical Foundations of Computer Science 1994
Montserrat HermoLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1994 841 403 (1994)
https://doi.org/10.1007/3-540-58338-6_87
55 (1993)
https://doi.org/10.1109/ICCI.1993.315404
On the Computational Complexity of Small Descriptions
Ricard Gavaldà and Osamu WatanabeSIAM Journal on Computing 22 (6) 1257 (1993)
https://doi.org/10.1137/0222075
Relating Equivalence and Reducibility to Sparse Sets
Eric Allender, Lane A. Hemachandra, Mitsunori Ogiwara and Osamu WatanabeSIAM Journal on Computing 21 (3) 521 (1992)
https://doi.org/10.1137/0221034
222 (1992)
https://doi.org/10.1109/SCT.1992.215396
Algorithms and Computation
V. Arvind, J. Köbler and M. MundhenkLecture Notes in Computer Science, Algorithms and Computation 650 249 (1992)
https://doi.org/10.1007/3-540-56279-6_78