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

On proving time constructibility of functions

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

DOI10.1016/0304-3975(85)90015-5zbMath0566.68042OpenAlexW2000496852MaRDI QIDQ1059393

Kojiro Kobayashi

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90015-5


zbMATH Keywords

time complexityTuring machine


Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (2)

Alternating time versus deterministic time: A separation ⋮ Deterministic Turing machines in the range between real-time and linear-time.



Cites Work

  • Unnamed Item
  • Circuit-size lower bounds and non-reducibility to sparse sets


This page was built for publication: On proving time constructibility of functions

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1059393&oldid=13070967"
Category:
  • Pages with script errors
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 00:26.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki