Matches in DBpedia 2014 for { <http://dbpedia.org/resource/IP_(complexity)> ?p ?o. }
Showing items 1 to 35 of
35
with 100 items per page.
- IP_(complexity) abstract "In computational complexity theory, the class IP (which stands for Interactive Polynomial time) is the class of problems solvable by an interactive proof system. The concept of an interactive proof system was first introduced by Shafi Goldwasser, Silvio Micali, and Charles Rackoff in 1985. An interactive proof system consists of two machines, a prover, P, which presents a proof that a given string n is a member of some language, and a verifier, V, that checks that the presented proof is correct. The prover is assumed to be infinite in computation and storage, while the verifier is a probabilistic polynomial-time machine with access to a random bit string whose length is polynomial on the size of n. These two machines exchange a polynomial number, p(n), of messages and once the interaction is completed, the verifier must decide whether or not n is in the language, with only a 1/3 chance of error. (So any language in BPP is in IP, since then the verifier could simply ignore the prover and make the decision on its own.)".
- IP_(complexity) wikiPageExternalLink 0907.4737.
- IP_(complexity) wikiPageExternalLink compip.
- IP_(complexity) wikiPageExternalLink frip.
- IP_(complexity) wikiPageExternalLink ipp.
- IP_(complexity) wikiPageExternalLink mip.
- IP_(complexity) wikiPageExternalLink qip.
- IP_(complexity) wikiPageExternalLink qip2.
- IP_(complexity) wikiPageExternalLink 146585.146613.
- IP_(complexity) wikiPageExternalLink citation.cfm?doid=146585.146609.
- IP_(complexity) wikiPageExternalLink citation.cfm?id=63434.
- IP_(complexity) wikiPageExternalLink 1985-stoc.pdf.
- IP_(complexity) wikiPageExternalLink 1986-stoc.pdf.
- IP_(complexity) wikiPageID "2197070".
- IP_(complexity) wikiPageRevisionID "587715156".
- IP_(complexity) hasPhotoCollection IP_(complexity).
- IP_(complexity) subject Category:Articles_containing_proofs.
- IP_(complexity) subject Category:Probabilistic_complexity_classes.
- IP_(complexity) type Abstraction100002137.
- IP_(complexity) type Class107997703.
- IP_(complexity) type Collection107951464.
- IP_(complexity) type Group100031264.
- IP_(complexity) type ProbabilisticComplexityClasses.
- IP_(complexity) comment "In computational complexity theory, the class IP (which stands for Interactive Polynomial time) is the class of problems solvable by an interactive proof system. The concept of an interactive proof system was first introduced by Shafi Goldwasser, Silvio Micali, and Charles Rackoff in 1985.".
- IP_(complexity) label "IP (complexity)".
- IP_(complexity) label "IP (complexité)".
- IP_(complexity) label "IP (複雜度)".
- IP_(complexity) sameAs IP_(complexité).
- IP_(complexity) sameAs IP_(복잡도).
- IP_(complexity) sameAs m.06v64d.
- IP_(complexity) sameAs Q5973158.
- IP_(complexity) sameAs Q5973158.
- IP_(complexity) sameAs IP_(complexity).
- IP_(complexity) wasDerivedFrom IP_(complexity)?oldid=587715156.
- IP_(complexity) isPrimaryTopicOf IP_(complexity).