Frequency of correctness versus average polynomial time (Q989533): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Hemaspaandra, Lane A. / rank
Normal rank
 
Property / author
 
Property / author: Hemaspaandra, Lane A. / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2009.05.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086276791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets and closeness to complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average Case Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voting schemes for which it can be difficult to tell who won the election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact analysis of Dodgson elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of Dodgson's rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on Levin’s Theory of Average-Case Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4359465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266133 / rank
 
Normal rank

Latest revision as of 02:21, 3 July 2024

scientific article
Language Label Description Also known as
English
Frequency of correctness versus average polynomial time
scientific article

    Statements

    Frequency of correctness versus average polynomial time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 August 2010
    0 references
    analysis of algorithms
    0 references
    average-case complexity
    0 references
    AvgP
    0 references
    computational complexity
    0 references
    frequently self-knowingly correct algorithms
    0 references
    heuristics
    0 references

    Identifiers