scientific article
From MaRDI portal
Publication:3221973
zbMath0558.03019MaRDI QIDQ3221973
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Eulerian and Hamiltonian graphs (05C45)
Related Items (13)
Parameterized Complexity Classes under Logical Reductions ⋮ Program Schemes with Deep Pushdown Storage ⋮ On digraph coloring problems and treewidth duality ⋮ Complete problems for monotone NP ⋮ A restricted second order logic for finite structures ⋮ A constant-space sequential model of computation for first-order logic ⋮ Methods for proving completeness via logical reductions ⋮ Independence-friendly logic without Henkin quantification ⋮ A restricted second order logic for finite structures ⋮ A constant-space sequential model of computation for first-order logic ⋮ Succinct representation, leaf languages, and projection reductions ⋮ On the power of deep pushdown stacks ⋮ Program schemes, arrays, Lindström quantifiers and zero-one laws
This page was built for publication:
