scientific article; zbMATH DE number 2080215
From MaRDI portal
Publication:4472458
zbMath1044.68062MaRDI QIDQ4472458
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1974/19740348.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (14)
Guarantees for the success frequency of an algorithm for finding Dodgson-election winners ⋮ Polynomial algorithms for protein similarity search for restricted mRNA structures ⋮ Dichotomy for voting systems ⋮ A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison ⋮ The complexity of comparing optimal solutions ⋮ The price of connectivity for dominating set: upper bounds and complexity ⋮ Unnamed Item ⋮ Complexity of stability ⋮ Complexity of Stability. ⋮ On the complexity of entailment in existential conjunctive first-order logic with atomic negation ⋮ Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP ⋮ Hybrid Elections Broaden Complexity-Theoretic Resistance to Control ⋮ Anyone but him: the complexity of precluding an alternative ⋮ The complexity of Kemeny elections
This page was built for publication:
