The following pages link to Takumi Kasai (Q1102115):
Displaying 29 items.
- Simultaneous (poly-time, log-space) lower bounds (Q1102116) (← links)
- A characterization of time complexity by simple loop programs (Q1137991) (← links)
- Space complexity in on-line computation (Q1167539) (← links)
- Translatability of flowcharts into while programs (Q1211348) (← links)
- Computational complexity of multitape Turing machines and random access machines (Q1249434) (← links)
- The Othello game on an \(n\times n\) board is PSPACE-complete (Q1314386) (← links)
- Relations among simultaneous complexity classes of nondeterministic and alternating Turing machines (Q1323339) (← links)
- Homomorphisms between models of parallel computation (Q1836982) (← links)
- Spinal-formed context-free tree grammars (Q1969437) (← links)
- A hierarchy between context-free and context-sensitive languages (Q2544411) (← links)
- (Q3217602) (← links)
- Gradually intractable problems and nondeterministic log-space lower bounds (Q3700836) (← links)
- A note on some simultaneous relations among time, space, and reversal for single work tape nondeterministic turing machines (Q3761700) (← links)
- Some combinatorial game problems require Ω( <i> n <sup>k</sup> </i> ) time (Q3768395) (← links)
- (Q3785941) (← links)
- (Q3785950) (← links)
- (Q3802609) (← links)
- Classes of Pebble Games and Complete Problems (Q3862399) (← links)
- (Q3907046) (← links)
- (Q3907070) (← links)
- (Q3957946) (← links)
- A universal context-free grammar (Q4055221) (← links)
- (Q4206403) (← links)
- (Q4253343) (← links)
- (Q4505370) (← links)
- Covering-languages of grammars (Q4769996) (← links)
- (Q4937853) (← links)
- (Q5405470) (← links)
- (Q5649985) (← links)
