David Lichtenstein
From MaRDI portal
Person:922709
Available identifiers
zbMath Open lichtenstein.davidMaRDI QIDQ922709
List of research outcomes
 | This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon! |
| Publication | Date of Publication | Type |
|---|---|---|
| A lower bound on the area of permutation layouts | 1991-01-01 | Paper |
| Some extremal problems arising from discrete control processes | 1989-01-01 | Paper |
| Planar Formulae and Their Uses | 1982-01-01 | Paper |
| Computing a perfect strategy for nxn chess requires time exponential in n | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912086 | 1981-01-01 | Paper |
| GO Is Polynomial-Space Hard | 1980-01-01 | Paper |
Research outcomes over time
This page was built for person: David Lichtenstein
