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

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

Détails bibliographiques
Publié dans:Information processing letters. 59, 4 (1996).
Auteur principal: Borchert, Bernd
Format: Article
Langue:English
Sujets:
Computational complexity.
Leaf language classes.
Succint representations.
Polynomial-time many-one completeness.