Ip Class

IP Class is a complexity class in computational complexity theory that consists of decision problems solvable by an interactive proof system where a polynomial-time verifier exchanges messages with a computationally unbounded prover to determine the membership of inputs in a language with high probability.

16

Publications

790

Citations

66

Authors

32

Institutions

Publications per year

2017–2026

7

Authors

66

  1. JH
    Johan Håstad

    KTH Royal Institute of Technology, Sweden

    3 publications · 111 citations

    3

    h-index

  2. SI
    Sohail Iqbal Malik

    Al-Buraimi University College, Oman

    3 publications · 258 citations

    3

    h-index

  3. RM
    Roy Mathew

    Al-Buraimi University College, Oman

    2 publications · 196 citations

    2

    h-index

  4. RM
    Ragad M Tawafak

    Al-Buraimi University College, Oman

    2 publications · 196 citations

    2

    h-index

  5. GB
    G. Billings

    Kyoto University, Japan

    1 publications · 28 citations

    1

    h-index

1–5 of 66

Venues

  1. 1

    h-index

  2. Communications of the ACM

    1 publications · 167 citations

    1

    h-index

  3. International Journal of Mechanical Engineering Education

    IJMEE · 1 publications · 10 citations

    1

    h-index

  4. Journal of Neurochemistry

    JNC · 1 publications · 42 citations

    1

    h-index

  5. 1

    h-index

1–5