scientific article; zbMATH DE number 1072538
From MaRDI portal
Publication:4359465
zbMath0880.68046MaRDI QIDQ4359465
Publication date: 8 October 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (16)
Complete on average Boolean satisfiability ⋮ Computational depth: Concept and applications ⋮ Guarantees for the success frequency of an algorithm for finding Dodgson-election winners ⋮ The complexity of generating test instances ⋮ Generalized juntas and NP-hard sets ⋮ No NP problems averaging over ranking of distributions are harder ⋮ Generic-case complexity, decision problems in group theory, and random walks. ⋮ Reductions and convergence rates of average time ⋮ Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey ⋮ Relations between average-case and worst-case complexity ⋮ Average-case complexity and decision problems in group theory. ⋮ Frequency of correctness versus average polynomial time ⋮ Average-Case Completeness in Tag Systems ⋮ Algorithms for the fixed point property ⋮ Complete distributional problems, hard languages, and resource-bounded measure ⋮ An efficient local search method for random 3-satisfiability
This page was built for publication:
