scientific article; zbMATH DE number 3889514
From MaRDI portal
Publication:3221973
Recommendations
Cited in
(21)- Methods for proving completeness via logical reductions
- A useful transform of standard input data for a classical NP-complete problem
- On completeness for NP via projection translations
- Independence-friendly logic without Henkin quantification
- A constant-space sequential model of computation for first-order logic
- A constant-space sequential model of computation for first-order logic
- Reducing the number of solutions of NP functions
- Parameterized Complexity Classes under Logical Reductions
- On the power of deep pushdown stacks
- Program schemes, arrays, Lindström quantifiers and zero-one laws
- Complete problems for monotone NP
- A restricted second order logic for finite structures
- Nonuniform reductions and NP-completeness
- Succinct representation, leaf languages, and projection reductions
- On digraph coloring problems and treewidth duality
- A restricted second order logic for finite structures
- A graph-transformational approach for proving the correctness of reductions between NP-problems
- Program Schemes with Deep Pushdown Storage
- Automatic Evaluation of Reductions between NP-Complete Problems
- scientific article; zbMATH DE number 4126690 (Why is no real title available?)
- scientific article; zbMATH DE number 408812 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3221973)
