scientific article; zbMATH DE number 176517

MaRDI QIDQ4035683zbMATH OpenFDO

Authors Jonathan F. Buss, J. Goldsmith

Publication date 18 May 1993

zbMATH Keywords

nondeterminismcomplete sets\(P=?\) NP

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Nondeterminism within $P^ * $
• Classes of bounded nondeterminism
• On nondeterminism in parallel computation
• scientific article; zbMATH DE number 1332665
• scientific article; zbMATH DE number 3903969

Cited in

(19)

• Nondeterminism through well-founded choice
• Towards separating nondeterminism from determinism
• On nondeterminism in parallel computation
• Remembering Chandra Kintala
• Classes of bounded nondeterminism
• Turing machines with atoms
• A source of inconsistency in theories of nondeterministic functions
• scientific article; zbMATH DE number 3846839 (Why is no real title available?)
• Deciding according to the shortest computations
• On Models of a Nondeterministic Computation
• scientific article; zbMATH DE number 4049046 (Why is no real title available?)
• scientific article; zbMATH DE number 1737510 (Why is no real title available?)
• scientific article; zbMATH DE number 827987 (Why is no real title available?)
• scientific article; zbMATH DE number 17527 (Why is no real title available?)
• Nondeterminism within $P^ * $
• scientific article; zbMATH DE number 4021119 (Why is no real title available?)
• A syntactical definition of the problem
• The emptiness problem for intersections of regular languages
• scientific article; zbMATH DE number 4045156 (Why is no real title available?)

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