The following pages link to Stefan Reisch (Q789896):
Displayed 5 items.
- Upper bounds for sorting integers on random access machines (Q789897) (← links)
- Hex ist Pspace-vollständig. (Hex is Pspace-complete) (Q1138494) (← links)
- A gap between the actual complexity of permutations and their entropy defined by Stoss (Q1157902) (← links)
- Gobang is PSPACE-complete (Q1255445) (← links)
- (Q3316593) (← links)