Pages that link to "Item:Q5902006"
From MaRDI portal
The following pages link to SOFSEM 2004: Theory and Practice of Computer Science (Q5902006):
Displaying 11 items.
- One-way reversible and quantum finite automata with advice (Q476173) (← links)
- Verifying time complexity of Turing machines (Q496007) (← links)
- Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories (Q793017) (← links)
- Pseudorandom generators against advised context-free languages (Q899305) (← links)
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- Amount of nonconstructivity in deterministic finite automata (Q1959651) (← links)
- Verifying whether one-tape Turing machines run in linear time (Q2009635) (← links)
- Constant-space quantum interactive proofs against multiple provers (Q2252642) (← links)
- Context-free languages can be accepted with absolutely no space overhead (Q2581536) (← links)
- Amount of Nonconstructivity in Finite Automata (Q3637360) (← links)
- Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions (Q6646016) (← links)