By Topic

On the knowledge complexity of 𝒩𝒫

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
E. Petrank ; Dept. of Comput. Sci., Toronto Univ., Ont., Canada ; G. Tardos

The authors show that if a language has an interactive proof of logarithmic statistical knowledge-complexity, then it belongs to the class 𝒜ℳ∩co-𝒜ℳ. Thus, if the polynomial time hierarchy does not collapse, then 𝒩𝒫-complete languages do not have logarithmic knowledge complexity. Prior to this work, there was no indication that would contradict 𝒩𝒫 languages being proven with even one bit of knowledge. Next, they consider the relation between the error probability and the knowledge complexity of an interactive proof. They show that if the error probability ε(n) is less than 2 -3k(n) (where k(n) is the knowledge complexity) then the language proven has to be in the third level of the polynomial time hierarchy. In order to prove their main result, they develop an 𝒜ℳ protocol for checking that a samplable distribution has a given entropy. They believe that this protocol is of independent interest

Published in:

Foundations of Computer Science, 1996. Proceedings., 37th Annual Symposium on

Date of Conference:

14-16 Oct 1996