Non-deterministic Polynomial Time

Non-Deterministic Polynomial Time is a computational complexity class that consists of decision problems for which a given solution can be verified by a deterministic Turing machine in polynomial time, distinguishing it from deterministic classes by allowing non-deterministic branching during computation.

148

Publications

6.6K

Citations

409

Authors

239

Institutions

Publications per year

2017–2026

64

Authors

409

  1. GI
    Gábor Ivanyos

    Hungarian Academy of Sciences, Hungary

    3 publications · 83 citations

    3

    h-index

  2. LG
    Leonid Gurvits

    Joint Institute for VLBI ERIC, Netherlands

    3 publications · 121 citations

    3

    h-index

  3. KV
    K. V. Subrahmanyam

    Chennai Mathematical Institute, India

    3 publications · 83 citations

    3

    h-index

  4. YQ
    Youming Qiao

    University of Technology Sydney, Australia

    3 publications · 83 citations

    3

    h-index

  5. MM
    M.K. Marichelvam

    Solamalai College of Engineering

    3 publications · 96 citations

    3

    h-index

1–5 of 409

Venues

  1. Theoretical Computer Science

    6 publications · 201 citations

    6

    h-index

  2. IEEE Access

    6 publications · 190 citations

    6

    h-index

  3. arXiv (Cornell University)

    Repository · 4 publications · 57 citations

    4

    h-index

  4. 3

    h-index

  5. SIAM Journal on Computing

    3 publications · 764 citations

    3

    h-index

1–5