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
Parents
16
Zhengfeng Ji, Anand Natarajan, Thomas Vidick et al. · Communications of the ACM · 2021 · 167 citations · Full text
Sohail Iqbal Malik, Mostafa Al‐Emran, Roy Mathew et al. · International Journal of Emerging Technologies in Learning (iJET) · 2020 · 69 citations · Full text
The random oracle hypothesis is false
Richard Chang, Benny Chor, Oded Goldreich et al. · Journal of Computer and System Sciences · 1994 · 66 citations · Full text
1–5 of 16
66
3
h-index
3
h-index
2
h-index
2
h-index
1
h-index
1–5 of 66
32
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
4 publications
236 citations
Al-Buraimi University College
Buraimi, Oman
3 h-index
8 publications
661 citations

KTH Royal Institute of Technology
Stockholm, Sweden
3 h-index
3 publications
111 citations
Core Competence
Santa Fe, United States
2 h-index
2 publications
45 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
1 h-index
1 publications
21 citations
Technion – Israel Institute of Technology
Haifa, Israel
1 h-index
2 publications
132 citations
Sprint (United States)
Overland Park, United States
1 h-index
2 publications
42 citations

Concordia University
Montreal, Canada
1 h-index
6 publications
174 citations
1–8 of 32
1 publications · 21 citations
1
h-index
1 publications · 167 citations
1
h-index
IJMEE · 1 publications · 10 citations
1
h-index
JNC · 1 publications · 42 citations
1
h-index
1 publications · 69 citations
1
h-index
1–5