Pages that link to "Item:Q3477959"

The following pages link to Nondeterministic linear-time tasks may require substantially nonlinear deterministic time in the case of sublinear work space (Q3477959):

Displayed 4 items.

• Graph properties checkable in linear time in the number of vertices (Q596315) ‎ (← links)
• Time-space tradeoffs for satisfiability (Q1567402) ‎ (← links)
• Lower bounds on the complexity of recognizing SAT by Turing machines (Q1603493) ‎ (← links)
• Time-space tradeoffs for SAT on nonuniform machines (Q5956015) ‎ (← links)