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

Authors

369

  1. DT
    Daniel Thomas

    Centre National de la Recherche Scientifique, France

    5 publications · 359 citations

    5

    h-index

  2. TV
    Thomas Vidick

    California Institute of Technology, United States

    4 publications · 267 citations

    4

    h-index

  3. AF
    Alexandrine Froger

    Université de Rennes, France

    4 publications · 320 citations

    4

    h-index

  4. KI
    Kenichi Ishibashi

    Tokyo University of Pharmacy and Life Sciences, Japan

    3 publications · 435 citations

    3

    h-index

  5. CT
    Christos T. Maravelias

    University of Wisconsin–Madison, United States

    3 publications · 96 citations

    3

    h-index

1–5 of 369

Venues

  1. Computers & Operations Research

    5 publications · 210 citations

    5

    h-index

  2. European Journal of Operational Research

    5 publications · 506 citations

    5

    h-index

  3. Molecular Microbiology

    4 publications · 809 citations

    4

    h-index

  4. Plant and Cell Physiology

    PCP · 2 publications · 118 citations

    2

    h-index

  5. Computers & Chemical Engineering

    2 publications · 52 citations

    2

    h-index

1–5