Generic-case complexity

Results: 6



#Item
1Computational complexity theory / Analysis of algorithms / Theory of computation / Computer science / Mathematics / Time complexity / Best /  worst and average case / Algorithm / Average-case complexity / Fast Fourier transform / Generic-case complexity

Computing Fundamentals Computational Complexity Salvatore Filippone–2015

Add to Reading List

Source URL: people.uniroma2.it

Language: English - Date: 2015-06-11 10:49:26
2

AVERAGE-CASE VS GENERIC-CASE COMPLEXITY OF LATTICE PROBLEMS Antonio R. Nicolosi∗ Computer Science Department Stevens Institute of Technology e-mail:

Add to Reading List

Source URL: www.cs.stevens.edu

- Date: 2012-07-26 11:58:34
    3Theory of computation / Computational complexity theory / Theoretical computer science / Computability theory / Analysis of algorithms / Complexity classes / Generic-case complexity / Halting problem / Time complexity / Algorithm / NP / Randomized algorithm

    PDF Document

    Add to Reading List

    Source URL: www.math.stevens.edu

    Language: English - Date: 2008-11-13 14:12:11
    4Mathematics / Computer science / Computable function / Recursive set / Computation in the limit / Generic-case complexity / Turing reduction / Halting problem / Blum axioms / Computability theory / Theoretical computer science / Theory of computation

    GENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY CARL G. JOCKUSCH, JR. AND PAUL E. SCHUPP Abstract. Generic decidability has been extensively studied in group theory, and we now study it in the context of cl

    Add to Reading List

    Source URL: www.math.uiuc.edu

    Language: English - Date: 2013-02-15 20:06:55
    5Mathematics / Computer science / Computable function / Recursive set / Recursively enumerable set / Enumeration / Generic-case complexity / Halting problem / Low / Computability theory / Theory of computation / Theoretical computer science

    ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS RODNEY G. DOWNEY, CARL G. JOCKUSCH, JR., AND PAUL E. SCHUPP Abstract. We study connections between classical asymptotic density, computability and computable enumerabilit

    Add to Reading List

    Source URL: www.math.uiuc.edu

    Language: English - Date: 2013-07-19 19:14:33
    6Computability theory / Analysis of algorithms / Theory of computation / Complexity classes / Generic-case complexity / Halting problem / Time complexity / Algorithm / Randomized algorithm / Theoretical computer science / Applied mathematics / Computational complexity theory

    PDF Document

    Add to Reading List

    Source URL: www.stevens.edu

    Language: English - Date: 2007-04-23 23:09:00
    UPDATE