116 citations to 10.1007/978-1-4757-4385-2 (Crossref Cited-By Service)
  1. M. B. Abbott, D. Solomatine, A. W. Minns, A. Verwey, W. Van Nievelt, “Education and training in hydroinformatics”, Journal of Hydraulic Research, 32, no. sup1, 1994, 203  crossref
  2. Lenore Blum, Mike Shub, Steve Smale, “On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines”, Bull. Amer. Math. Soc., 21, no. 1, 1989, 1  crossref
  3. Domenico Cantone, Pietro Maugeri, Eugenio G. Omodeo, “Complexity assessments for decidable fragments of set theory. II: A taxonomy for ‘small’ languages involving membership”, Theoretical Computer Science, 848, 2020, 28  crossref
  4. B. Buchberger, R. Loos, 4, Computer Algebra, 1983, 11  crossref
  5. A. N. Dranishnikov, G. Gong, V. Lafforgue, G. Yu, “Uniform Embeddings into Hilbert Space and a Question of Gromov”, Can. math. bull., 45, no. 1, 2002, 60  crossref
  6. Paola D'aquino, The Notre Dame Lectures, 2017, 149  crossref
  7. Stefan Ufer, Aiso Heinze, Sebastian Kuntze, Franziska Rudolph-Albert, “Beweisen und Begründen im Mathematikunterricht”, JMD, 30, no. 1, 2009, 30  crossref
  8. Richard A. De Millo, Richard J. Lipton, Alan J. Perlis, “Social processes and proofs of theorems and programs”, Commun. ACM, 22, no. 5, 1979, 271  crossref
  9. A. Velazquez, A. Chowdhury, 2968, THE 5TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE IN INFORMATION SYSTEMS (CIIS 2022): Intelligent and Resilient Digital Innovations for Sustainable Living, 2023, 070001  crossref
  10. J. A. Bergstra, J. V. Tucker, “Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems”, SIAM J. Comput., 12, no. 2, 1983, 366  crossref
Previous
1
2
3
4
5
6
7
8
12
Next