Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article

From MaRDI portal
Publication:4016552
Jump to:navigation, search

zbMATH Open0755.68070arXivcs/9301113MaRDI QIDQ4016552FDOQ4016552


Authors: Donald E. Knuth Edit this on Wikidata


Publication date: 16 January 1993


Full work available at URL: https://arxiv.org/abs/cs/9301113

Title of this publication is not available (Why is that?)



Recommendations

  • scientific article; zbMATH DE number 88985
  • Do we need recursion?
  • scientific article; zbMATH DE number 3900733
  • scientific article; zbMATH DE number 2063247
  • scientific article; zbMATH DE number 679694


zbMATH Keywords

nested recursion``91 function


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)



Cited In (6)

  • Description, implementation, and evaluation of a generic design for tabled CLP
  • The termination of the higher-dimensional tarai functions
  • Title not available (Why is that?)
  • “Curiouser and curiouser” said alice. further reflections on an interesting recursive function
  • Title not available (Why is that?)
  • Title not available (Why is that?)





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4016552)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4016552&oldid=17718362"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 01:46. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki