The following pages link to David Lichtenstein (Q922709):
Displayed 7 items.
- Item:Q922709 (redirect page) (← links)
- Some extremal problems arising from discrete control processes (Q913685) (← links)
- A lower bound on the area of permutation layouts (Q922710) (← links)
- Computing a perfect strategy for nxn chess requires time exponential in n (Q1156090) (← links)
- GO Is Polynomial-Space Hard (Q3873542) (← links)
- (Q3912086) (← links)
- Planar Formulae and Their Uses (Q3936195) (← links)