Pages that link to "Item:Q1401957"

The following pages link to Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. (Q1401957):

Displaying 2 items.

• On the relative succinctness of sentential decision diagrams (Q2322709) (← links)
• A hierarchy result for read-once branching programs with restricted parity nondeterminism (Q2566039) (← links)