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

Determinism versus nondeterminism with arithmetic tests and computation

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

DOI10.1145/2213977.2214001zbMATH Open1286.68122OpenAlexW1979394993MaRDI QIDQ5415479

Miklós Ajtai

Publication date: 13 May 2014

Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2213977.2214001



zbMATH Keywords

quantifier eliminationlower bounddiagonalizationnondeterministic computation


Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)



Related Items (1)

Strong determinism vs. computability






This page was built for publication: Determinism versus nondeterminism with arithmetic tests and computation

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5415479&oldid=20158581"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 9 February 2024, at 03:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki