Live briefing
Everything about IP (complexity)
Complexity class from interactive proofs
In computational complexity theory, the class IP is the class of problems solvable by an interactive proof system. It is equal to the class PSPACE. The result was established in a series of papers: the first by Lund, Karloff, Fortnow, and Nisan showed that co-NP had multiple-prover interactive proofs; and the second, by Shamir, employed their technique to establish that IP=PSPACE. The result is a famous example where the proof does not relativize. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: IP (complexity)A 5-minute orientation
- Skim a recent paper: Dynamical memristors for higher-complexity neuromorphic computingInfluential work since 2022
- Pick up a classic book: The Conspirators HierarchyThe most-reprinted book on the subject
- Read the landmark paper: Bayesian Measures of Model Complexity and FitCited 10,371 times
- Go sideways: Heyting arithmeticA closely related topic
- Go sideways: Karp–Lipton theoremA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Bayesian Measures of Model Complexity and Fit
MUSCLE: a multiple sequence alignment method with reduced time and space complexity
Approximate entropy as a measure of system complexity.
Permutation Entropy: A Natural Complexity Measure for Time Series
The Complexity of Intersectionality
A Complexity Measure
Institutional Complexity and Organizational Responses
Food Web Complexity and Species Diversity
🆕 Influential since 2022
Dynamical memristors for higher-complexity neuromorphic computing
Embracing cancer complexity: Hallmarks of systemic disease
Understanding the complexity of p53 in a new era of tumor suppression
Soil microbial network complexity predicts ecosystem function along elevation gradients on the Tibetan Plateau
Co-occurrence networks reveal more complexity than community composition in resistance and resilience of microbial communities
đź“š Books worth reading
The Conspirators HierarchyJohn Coleman · 1992
Fundamentals of data structures in CEllis Horowitz · 1993
Parameters and Functional HeadsAdriana Belletti · 1996
Cryptography and network securityWilliam Stallings · 2006
Handbook of research on artificial immune systems and natural computingHongwei Mo · 2009
OpenStack essentialsDan Radez · 2015
Introduction to the theory of computationMichael Sipser · 1996- 📕Crossing CulturesJaynie Anderson · 2009
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Heyting arithmetic In mathematical logic, Heyting arithmetic H A {\displaystyle {\mathsf {HA}}} is an axiomatization of arithmetic in accordance with the philosophy of intuitionis…
- Karp–Lipton theorem In complexity theory, the Karp–Lipton theorem states that if the Boolean satisfiability problem (SAT) can be solved by Boolean circuits with a polynomial…
- Interactive proof system In computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between two…
- Arthur–Merlin protocol In computational complexity theory, an Arthur–Merlin protocol, introduced by Babai (1985), is an interactive proof system in which the verifier's coin…
- Padding argument In computational complexity theory, the padding argument is a tool to conditionally prove that if some complexity classes are equal, then some other bigger…
- Morphism of algebraic varieties In algebraic geometry, a morphism between algebraic varieties is a function between the varieties that is given locally by polynomials. It is also called…
- Time hierarchy theorem In computational complexity theory, the time hierarchy theorems are important statements about time-bounded computation on Turing machines. Informally…
- Zariski's lemma In algebra, Zariski's lemma, proved by Oscar Zariski (1947), states that, if a field K is finitely generated as an associative algebra over another field…