Sang Cho
From MaRDI portal
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 Information Processing Letters | 1993-01-16 | Paper |
| The parallel complexity of finite-state automata problems Information and Computation | 1992-06-28 | Paper |
| Finite-automaton aperiodicity is PSPACE-complete Theoretical Computer Science | 1991-01-01 | Paper |
| The complexity of membership for deterministic growing context-sensitive grammars∗ International Journal of Computer Mathematics | 1990-01-01 | Paper |
| On a complexity hierarchy between L and NL Information Processing Letters | 1988-01-01 | Paper |
Research outcomes over time
This page was built for person: Sang Cho
