scientific article; zbMATH DE number 4043254

MaRDI QIDQ3780445zbMATH OpenFDO

Authors A. K. Dewdney

Publication date 1986

zbMATH Keywords

combinatorial problemsnon-deterministic Turing machinesgeneric reduction computer

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 4037175
• scientific article; zbMATH DE number 2154080
• Reducing Nondeterminism in the Calculus of Structures
• scientific article; zbMATH DE number 2084366
• scientific article; zbMATH DE number 4024793
• Decompositions of nondeterministic reductions
• scientific article; zbMATH DE number 3960995
• scientific article; zbMATH DE number 4041248
• Strong nondeterministic Turing reduction - a technique for proving intractability
• scientific article; zbMATH DE number 2086639

Cited in

(6)

• scientific article; zbMATH DE number 97096 (Why is no real title available?)
• Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants
• scientific article; zbMATH DE number 4037175 (Why is no real title available?)
• Short propositional formulas represent nondeterministic computations
• scientific article; zbMATH DE number 88938 (Why is no real title available?)
• Computing in unpredictable environments: semantics, reduction strategies, and program transformations

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