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:
Ker-I Ko
RAIRO-Theor. Inf. Appl., 24 3 (1990) 229-240
Published online: 2017-02-01
This article has been cited by the following article(s):
11 articles
Black Box Optimization, Machine Learning, and No-Free Lunch Theorems
Rong Jin, Weili Wu, My T. Thai and Ding-Zhu Du Springer Optimization and Its Applications, Black Box Optimization, Machine Learning, and No-Free Lunch Theorems 170 163 (2021) https://doi.org/10.1007/978-3-030-66515-9_6
171 (2005) https://doi.org/10.1007/3-540-28520-2_5
361 (2005) https://doi.org/10.1007/3-540-28520-2_8
Quantum and classical complexity classes: Separations, collapses, and closure properties
Holger Spakowski, Mayur Thakur and Rahul Tripathi Information and Computation 200 (1) 1 (2005) https://doi.org/10.1016/j.ic.2004.10.009
261 (2005) https://doi.org/10.1007/3-540-28520-2_6
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Holger Spakowski, Mayur Thakur and Rahul Tripathi Lecture 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
H. Buhrman and L. Torenvliet 227 (1999) https://doi.org/10.1109/CCC.1999.766281
Immunity and Simplicity for Exact Counting and Other Counting Classes
J. Rothe RAIRO - Theoretical Informatics and Applications 33 (2) 159 (1999) https://doi.org/10.1051/ita:1999100
Strong self-reducibility precludes strong immunity
L. A. Hemaspaandra and M. Zimand Mathematical Systems Theory 29 (5) 535 (1996) https://doi.org/10.1007/BF01184814
Worlds to die for
Lane A. Hemaspaandra, Ajit Ramachandran and Marius Zimand ACM SIGACT News 26 (4) 5 (1995) https://doi.org/10.1145/219817.219822
A uniform approach to define complexity classes
Daniel P. Bovet, Pierluigi Crescenzi and Riccardo Silvestri Theoretical Computer Science 104 (2) 263 (1992) https://doi.org/10.1016/0304-3975(92)90125-Y