Pages that link to "Item:Q671606"
From MaRDI portal
The following pages link to Succinct circuit representations and leaf language classes are basically the same concept (Q671606):
Displayed 5 items.
- Leaf languages and string compression (Q550251) (← links)
- Succinct representation, leaf languages, and projection reductions (Q1271623) (← links)
- Succinctness as a source of complexity in logical formalisms (Q1302307) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
- UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS (Q4528761) (← links)