Frequency of correctness versus average polynomial time
type: Item
instance of: scholarly article
title: Frequency of correctness versus average polynomial time
zbMATH Open document ID: 1200.68124
author: Gábor Erdélyi
author: Jörg Rothe
author: Holger Spakowski
author: Lane A. Hemaspaandra
published in: Information Processing Letters
publication date: 2010-08-20T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5773830
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: average-case complexity
zbMATH Keywords: AvgP
zbMATH Keywords: computational complexity
zbMATH Keywords: frequently self-knowingly correct algorithms
zbMATH Keywords: heuristics
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.05.001
OpenAlex ID: W2086276791
cites work: Complete sets and closeness to complexity classes
cites work: Average Case Complete Problems
cites work: Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners
cites work: Voting schemes for which it can be difficult to tell who won the election
cites work: Exact analysis of Dodgson elections
cites work: Approximability of Dodgson's rule
cites work: Notes on Levin’s Theory of Average-Case Complexity
cites work: Q4359465
cites work: Q3266133
DOI: 10.1016/J.IPL.2009.05.001
description: scientific article; zbMATH DE number 5773830