Pages that link to "Item:Q1271623"
From MaRDI portal
The following pages link to Succinct representation, leaf languages, and projection reductions (Q1271623):
Displaying 12 items.
- Languages represented by Boolean formulas (Q290253) (← links)
- Model-checking hierarchical structures (Q414908) (← links)
- Leaf languages and string compression (Q550251) (← links)
- Succinct circuit representations and leaf language classes are basically the same concept (Q671606) (← links)
- Methods for proving completeness via logical reductions (Q685391) (← links)
- Succinctness as a source of complexity in logical formalisms (Q1302307) (← links)
- Functions computable in polynomial space (Q1775891) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
- The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis (Q2272200) (← links)
- Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes (Q3088284) (← links)
- Equality Testing of Compressed Strings (Q3449353) (← links)
- Specular Sets (Q3449371) (← links)