Succinct circuit representations and leaf language classes are basically the same concept.

Succinct circuit representations and leaf language classes are basically the same concept.

Dettagli Bibliografici
Pubblicato in:Information processing letters. 59, 4 (1996).
Autore principale: Borchert, Bernd
Natura: Articolo
Lingua:English
Soggetti:
Computational complexity.
Leaf language classes.
Succint representations.
Polynomial-time many-one completeness.