Person:922709: Difference between revisions
From MaRDI portal
Person:922709
m AuthorDisambiguator moved page David Lichtenstein to David Lichtenstein: Duplicate |
Created automatically from import240128110107 |
||
| Line 1: | Line 1: | ||
{{ | {{person}} | ||
Latest revision as of 14:54, 28 January 2024
Available identifiers
zbMath Open lichtenstein.davidMaRDI QIDQ922709
List of research outcomes
| 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
Doctoral students
No records found.
Known relations from the MaRDI Knowledge Graph
| Property | Value |
|---|---|
| MaRDI profile type | MaRDI person profile |
| instance of | human |
This page was built for person: David Lichtenstein
