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:

On the complexity of computable real sequences

Jacobo Torán

RAIRO-Theor. Inf. Appl., 21 2 (1987) 175-180

Published online: 2017-02-01

DOI: https://doi.org/10.1051/ita/1987210201751

PDF (470 KB)
References

This article has been cited by the following article(s):

The expressibility of functions on the boolean domain, with applications to counting CSPs

Andrei A. Bulatov, Martin Dyer, Leslie Ann Goldberg, Mark Jerrum and Colin Mcquillan
Journal of the ACM 60 (5) 1 (2013)
https://doi.org/10.1145/2528401