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

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

Detalhes bibliográficos
Publicado no:Information processing letters. 59, 4 (1996).
Autor principal: Borchert, Bernd
Formato: Artigo
Idioma:English
Assuntos:
Computational complexity.
Leaf language classes.
Succint representations.
Polynomial-time many-one completeness.