scientific article; zbMATH DE number 4043254

zbMATH Open0639.68049MaRDI QIDQ3780445FDOQ3780445

Authors: A. K. Dewdney 

Publication date: 1986

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

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

zbMATH Keywords

combinatorial problemsnon-deterministic Turing machinesgeneric reduction computer

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (6)

• Computing in unpredictable environments: semantics, reduction strategies, and program transformations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Short propositional formulas represent nondeterministic computations
• Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants
• Title not available (Why is that?)

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)