Succinct circuit representations and leaf language classes are basically the same concept (Q671606)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 983399
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Succinct circuit representations and leaf language classes are basically the same concept |
scientific article; zbMATH DE number 983399 |
Statements
Succinct circuit representations and leaf language classes are basically the same concept (English)
0 references
27 February 1997
0 references
Computational complexity
0 references
Leaf language classes
0 references
Succinct representations
0 references
Polynomial-time many-one completeness
0 references
0.7906783223152161
0 references
0.7440431118011475
0 references
0.7338974475860596
0 references
0.7238700985908508
0 references
