Pages that link to "Item:Q3988061"
From MaRDI portal
The following pages link to Complete Problems Involving Boolean Labelled Structures and Projection Transactions (Q3988061):
Displaying 10 items.
- Methods for proving completeness via logical reductions (Q685391) (← links)
- Succinct representation, leaf languages, and projection reductions (Q1271623) (← links)
- Positive versions of polynomial time (Q1281503) (← links)
- Succinctness as a source of complexity in logical formalisms (Q1302307) (← links)
- Context-sensitive transitive closure operators (Q1319508) (← links)
- Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy. (Q1401202) (← links)
- Program schemes, arrays, Lindström quantifiers and zero-one laws (Q1606129) (← links)
- Enhancing context knowledge repositories with justifiable exceptions (Q1749389) (← links)
- Relativized logspace and generalized quantifiers over finite ordered structures (Q4358054) (← links)
- Normal Form Nested Programs (Q5900402) (← links)