Non-deterministic Time Complexity

Non-Deterministic Time Complexity is the computational complexity measure that characterizes the maximum number of steps a non-deterministic Turing machine requires to solve a decision problem over all possible computation paths for a given input size.

19

Publications

641

Citations

42

Authors

31

Institutions

Publications per year

2017–2026

2

Authors

42

  1. SC
    Stephen Cook

    University of Toronto, Canada

    2 publications · 220 citations

    2

    h-index

  2. PG
    Paweł Gniewek

    University of Warsaw, Poland

    1 publications · 17 citations

    1

    h-index

  3. BM
    Barnaby Martin

    Durham University, United Kingdom

    1 publications · 15 citations

    1

    h-index

  4. IP
    Ian Pratt‐Hartmann

    University of Manchester, United Kingdom

    1 publications · 22 citations

    1

    h-index

  5. UH
    Ulrich Hertrampf

    University of Würzburg, Germany

    1 publications · 26 citations

    1

    h-index

1–5 of 42

Venues

  1. Journal of Computer and System Sciences

    2 publications · 190 citations

    2

    h-index

  2. eCommons (Cornell University)

    Repository · 1 publications · 19 citations

    1

    h-index

  3. BMC Bioinformatics

    1 publications · 17 citations

    1

    h-index

  4. arXiv (Cornell University)

    Repository · 1 publications · 22 citations

    1

    h-index

  5. SIAM Journal on Computing

    1 publications · 13 citations

    1

    h-index

1–5