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; zbMATH DE number 3588047

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

zbMATH Open0377.68035MaRDI QIDQ4155834FDOQ4155834


Authors: K. M. Podnieks Edit this on Wikidata


Publication date: 1977



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




Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25)



Cited In (3)

  • Inductive inference of recursive functions: complexity bounds
  • On the inference of approximate programs
  • Amount of nonconstructivity in deterministic finite automata





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 Q4155834)

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