Back to Results
First PageMeta Content
Complexity classes / Structural complexity theory / Probabilistic complexity theory / Mathematical optimization / Arthur–Merlin protocol / Interactive proof system / NP / IP / Bounded-error probabilistic polynomial / Theoretical computer science / Computational complexity theory / Applied mathematics


Document Date: 2006-12-19 17:14:50

Open Document

File Size: 2,39 MB

Share Result on Facebook

City

Haifa / Providence / MAMA / Chicago / /

Company

Academx Press Inc. / /

Country

Hungary / /

Currency

USD / /

Facility

Complexity Classes LAsz~6 BABAI Eiirviis University / /

IndustryTerm

software error / interactive proof systems / elegant and simple protocols / proof systems / formal systems / /

Organization

Complexity Classes LAsz~6 BABAI Eiirviis University / Budapest / Technion / /

Person

Clemens Lautemann / Merlin / Gary Miller / SHLOMO MORAN / Should Dick Karp / Arthur / Noam Nissan / /

Position

King / /

ProvinceOrState

Rhode Island / Massachusetts / /

RadioStation

IP(t(n))E AM / Theorem E AM / AM AM / MA E AM / E AM / MA G AM / /

Technology

GMR protocols / Randomized Proof System Arthur-Merlin protocols / GMR protocol / Arthur-Merlin Hierarchy An Arthur-Merlin protocol / Arthur-Merlin protocols / Monte Carlo algorithms / /

SocialTag