Pages that link to "Item:Q1183577"

The following pages link to An NP-complete language accepted in linear time by a one-tape Turing machine (Q1183577):

Displayed 5 items.

• One-way reversible and quantum finite automata with advice (Q476173) ‎ (← links)
• Theory of one-tape linear-time Turing machines (Q1041220) ‎ (← links)
• Verifying whether one-tape Turing machines run in linear time (Q2009635) ‎ (← links)
• THE ROLES OF ADVICE TO ONE-TAPE LINEAR-TIME TURING MACHINES AND FINITE AUTOMATA (Q3069734) ‎ (← links)
• Two-way automata and length-preserving homomorphisms (Q4879206) ‎ (← links)