scientific article; zbMATH DE number 3889514
From MaRDI portal
Publication:3221973
zbMATH Open0558.03019MaRDI QIDQ3221973FDOQ3221973
Authors: Elias Dahlhaus 
Publication date: 1984
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Eulerian and Hamiltonian graphs (05C45) Complexity of computation (including implicit computational complexity) (03D15)
Cited In (21)
- On completeness for NP via projection translations
- A restricted second order logic for finite structures
- A constant-space sequential model of computation for first-order logic
- A constant-space sequential model of computation for first-order logic
- Methods for proving completeness via logical reductions
- Complete problems for monotone NP
- Program Schemes with Deep Pushdown Storage
- Independence-friendly logic without Henkin quantification
- Parameterized Complexity Classes under Logical Reductions
- A restricted second order logic for finite structures
- Succinct representation, leaf languages, and projection reductions
- On the power of deep pushdown stacks
- Program schemes, arrays, Lindström quantifiers and zero-one laws
- Reducing the number of solutions of NP functions
- A graph-transformational approach for proving the correctness of reductions between NP-problems
- A useful transform of standard input data for a classical NP-complete problem
- Automatic Evaluation of Reductions between NP-Complete Problems
- Title not available (Why is that?)
- On digraph coloring problems and treewidth duality
- Title not available (Why is that?)
- Nonuniform reductions and NP-completeness
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)
