Complete Problems Involving Boolean Labelled Structures and Projection Transactions
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3927731
- scientific article; zbMATH DE number 408812
- On completeness for NP via projection translations
- On the structure of solution-graphs for Boolean formulas
- scientific article; zbMATH DE number 150219
- scientific article; zbMATH DE number 1670770
- Boolean satisfiability with transitivity constraints
- Complete problems for fixed-point logics
- On the structure of Boolean satisfiability
- scientific article; zbMATH DE number 871455
Cited in
(11)- Greedy algorithms, H-colourings and a complexity-theoretic dichotomy.
- On completeness for NP via projection translations
- Positive versions of polynomial time
- Normal Form Nested Programs
- Relativized logspace and generalized quantifiers over finite ordered structures
- Enhancing context knowledge repositories with justifiable exceptions
- Methods for proving completeness via logical reductions
- Succinctness as a source of complexity in logical formalisms
- Context-sensitive transitive closure operators
- Succinct representation, leaf languages, and projection reductions
- Program schemes, arrays, Lindström quantifiers and zero-one laws
This page was built for publication: Complete Problems Involving Boolean Labelled Structures and Projection Transactions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3988061)