Determinism versus nondeterminism with arithmetic tests and computation

DOI10.1145/2213977.2214001MaRDI QIDQ5415479zbMATH OpenOpenAlexFDO

Authors 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

diagonalizationlower boundnondeterministic computationquantifier elimination

Mathematics Subject Classification ID

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

Cited in

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