a language is in MP if and only if it has a polynomial time verifier
Forum » Discussions / Q&A, Spring 2010 » a language is in MP if and only if it has a polynomial time verifier
Started by: Tammy Dagan (guest)
Date: 26 Jun 2010 16:08
Number of posts: 4
rss icon RSS: New posts
New Post
Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License