Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The computational complexity of program schemata

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

DOI10.1016/S0022-0000(76)80020-7zbMath0321.68036MaRDI QIDQ1223162

Weihrauch, Klaus

Publication date: 1976

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)



Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) General topics in the theory of software (68N01) Algorithms in computer science (68W99)


Related Items (1)

Unnamed Item



Cites Work

  • On formalised computer programs
  • Equivalence of programs with structured variables
  • A Machine-Independent Theory of the Complexity of Recursive Functions
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: The computational complexity of program schemata

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1223162&oldid=13298573"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 07:15.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki