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 3562523

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

zbMATH Open0361.68074MaRDI QIDQ4134974FDOQ4134974


Authors: Stephen Cook Edit this on Wikidata


Publication date: 1972



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




Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)



Cited In (9)

  • Expressivity and Complexity of Dependence Logic
  • Finite-model theory -- A personal perspective
  • Proving that \(\mathrm{prBPP}=\mathrm{prP}\) is as hard as proving that ``almost NP is not contained in P/poly
  • Complexity barriers as independence
  • A logical approach to locality in pictures languages
  • On the extension of Gladkij's theorem and the hierarchies of languages
  • On the dynamics between gravity and entanglement
  • On two-way multihead automata
  • Translational lemmas, polynomial time, and \((\log n)^j\)-space





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

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