Richard A. Flower
From MaRDI portal
Person:4061950
Available identifiers
zbMath Open flower.richard-aMaRDI QIDQ4061950
List of research outcomes
| Publication | Date of Publication | Type |
|---|---|---|
| The Complexity of Some Simple Retrieval Problems | 1975-01-01 | Paper |
| Hypothesis testing with finite memory in finite time (Corresp.) | 1972-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: Richard A. Flower
