Publication:4472458
From MaRDI portal
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
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
The complexity of Kemeny elections, Guarantees for the success frequency of an algorithm for finding Dodgson-election winners, Dichotomy for voting systems, Anyone but him: the complexity of precluding an alternative, Polynomial algorithms for protein similarity search for restricted mRNA structures, Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP, Hybrid Elections Broaden Complexity-Theoretic Resistance to Control