Sang Cho
From MaRDI portal
Person:809607
Available identifiers
zbMath Open cho.sangMaRDI QIDQ809607
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 |
|---|---|---|
| The parallel complexity of coarsest set partition problems | 1993-01-16 | Paper |
| The parallel complexity of finite-state automata problems | 1992-06-28 | Paper |
| Finite-automaton aperiodicity is PSPACE-complete | 1991-01-01 | Paper |
| The complexity of membership for deterministic growing context-sensitive grammars∗ | 1990-01-01 | Paper |
| On a complexity hierarchy between L and NL | 1988-01-01 | Paper |
Research outcomes over time
This page was built for person: Sang Cho
