Mip Class
MIP Class is a complexity class in computational complexity theory that consists of decision problems solvable by a polynomial-time verifier interacting with multiple all-powerful provers sharing no communication, distinguishing it from other interactive proof classes by the multiprover interactive protocol structure.
105
Publications
7.5K
Citations
369
Authors
173
Institutions
Publications per year
2017–2026
24
Parents
105
Kenichi Ishibashi, Michio Kuwahara, Yong Gu et al. · Journal of Biological Chemistry · 1997 · 383 citations · Full text
1–5 of 105
369
5
h-index
4
h-index
4
h-index
Tokyo University of Pharmacy and Life Sciences, Japan
3 publications · 435 citations
3
h-index
3
h-index
1–5 of 369
173

Centre National de la Recherche Scientifique
Paris, France
8 h-index
42 publications
1.9K citations
Université de Rennes
Rennes, France
5 h-index
33 publications
1.5K citations
UCLouvain
Louvain-la-Neuve, Belgium
5 h-index
11 publications
1K citations
KU Leuven
Leuven, Belgium
4 h-index
20 publications
5.4K citations

Vrije Universiteit Amsterdam
Amsterdam, The Netherlands
3 h-index
9 publications
436 citations

Lund University
Lund, Sweden
3 h-index
11 publications
1.4K citations
University of Wisconsin–Madison
Madison, United States
3 h-index
6 publications
221 citations
Tokyo Medical and Dental University
Tokyo, Japan
3 h-index
11 publications
1.3K citations
1–8 of 173
5 publications · 210 citations
5
h-index
5 publications · 506 citations
5
h-index
4 publications · 809 citations
4
h-index
PCP · 2 publications · 118 citations
2
h-index
2 publications · 52 citations
2
h-index
1–5