Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. (Q1401957)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1967143
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. |
scientific article; zbMATH DE number 1967143 |
Statements
Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. (English)
0 references
19 August 2003
0 references
OBDDs
0 references
Branching programs
0 references
One-way Turing machines
0 references
Nondeterminism
0 references
Guess-and-verify
0 references
Space complexity
0 references
Lower bounds
0 references
Ordered binary decision diagrams
0 references
0 references
0 references
0.899718165397644
0 references
0.7611727118492126
0 references
0.7587741613388062
0 references
0.7560297846794128
0 references
