A Predictor-Impossibility Theorem over an activation hierarchy is used to construct an aggregate language MIS and prove MIS ∈ NP ∖ P.
Sipser,Introduction to the Theory of Computation, 3rd ed., Cengage Learning, 2012
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Fixed Points, a Predictor-Impossibility Theorem, and Applications
A Predictor-Impossibility Theorem over an activation hierarchy is used to construct an aggregate language MIS and prove MIS ∈ NP ∖ P.