Skip to search formSkip to main contentSkip to account menu

Immerman–Szelepcsényi theorem

Known as: Immerman-Szelepcsenyi Theorem, Immerman-Szelepcsényi theorem, Immerman–Szelepcsenyi theorem 
In computational complexity theory, the Immerman–Szelepcsényi theorem states that nondeterministic space complexity classes are closed under… 
Wikipedia (opens in a new tab)

Related topics

Related topics

26 relations
2-satisfiabilityAlternating Turing machineCo-NPComplement (complexity)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Examen de complexité avancée 2016
  • 2016
  • Corpus ID: 14273724
Printed lecture notes allowed. No access to the Internet, no computer, no cell phone. All the theorems you use must be cited… 
2008
2008
Generalizations of the Hartmanis-Immerman-Sewelson Theorem and Applications to Infinite Subsets of P-Selective Sets
  • Till Tantau
  • Electron. Colloquium Comput. Complex.
  • 2008
  • Corpus ID: 14992735
The Hartmanis–Immerman–Sewelson theorem is the classical link between the exponential and the polynomial time realm. It states… 
2007
2007
Les Représentations Prédictives des États et des Politiques
We discuss the problem of policy representation in stochastic and partially observable systems, and address the case where the… 
1994
1994
Generalized quantifiers for simple properties
  • M. Otto
  • Proceedings Ninth Annual IEEE Symposium on Logic…
  • 1994
  • Corpus ID: 31062490
We consider extensions of fixed-point logic by means of generalized quantifiers in the context of descriptive complexity. By the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)