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.
2019
2019
Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm
As it is well known, the isomorphism problem for vertex-colored graphs with color multiplicity at most 3 is solvable by the… 
Highly Cited
2013
Highly Cited
2013
Turing Machines with Atoms
We study Turing machines over sets with atoms, also known as nominal sets. Our main result is that deterministic machines are… 
2010
2010
The Graph Isomorphism Problem and approximate categories
2008
2008
Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract)
2007
2007
The Power of Counting Logics on Restricted Classes of Finite Structures
Although Cai, Furer and Immerman have shown that fixed-point logic with counting (IFP+C) does not express all polynomial-time… 
Highly Cited
2004
Highly Cited
2004
The succinctness of first-order logic on linear orders
Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L/sub 1/ is more succinct… 
2001
2001
Number of variables is equivalent to space
Abstract We prove that the set of properties describable by a uniform sequence of first-order sentences using at most k + 1… 
1998
1998
On Highly Closed Cellular Algebras and Highly Closed Isomorphisms
We define and study $m$-closed cellular algebras (coherent configurations) and $m$-isomorphisms of cellular algebras which can be… 
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… 
Highly Cited
1989
Highly Cited
1989
Expressibility and Parallel Complexity
  • N. Immerman
  • SIAM journal on computing (Print)
  • 1989
  • Corpus ID: 15606315
It is shown that the time needed by a concurrent-read, concurrent-write parallel random access machine (CRAM) to check if an… 
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)