EXPSPACE

Known as: NEXPSPACE 
In complexity theory, 'EXPSPACE' is the set of all decision problems solvable by a deterministic Turing machine in O(2p(n)) space, where p(n) is a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We present a satisfiability algorithm for k-indexed binary decision diagrams (k-IBDDs). The proposed exponential space and… (More)
  • figure 1
  • figure 4
  • figure 5
Is this relevant?
2016
2016
Reachability analysis is a tool for formal equivalence and model checking of sequential circuits. Conventional techniques are… (More)
  • figure 1
  • figure 2
  • table I
Is this relevant?
2010
2010
A disentanglement puzzle consists of mechanically interlinked pieces, and the puzzle is solved by disentangling one piece from… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2009
2009
We investigate the simulation preorder between finite-state systems and a simple subclass of Petri nets, communication-free nets… (More)
Is this relevant?
2009
2009
Optical architectures that use exponential space for solving instances of the (non-necessarily-binary) permanent are presented… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
There are two main solving schemas for constraint satisfaction and optimization problems: i) search, whose basic step is… (More)
  • figure 3
  • figure 5
  • figure 6
  • figure 7
  • figure 8
Is this relevant?
2000
2000
Variable elimination is the basic step of Adaptive Consistency[4]. It transforms the problem into an equivalent one, having one… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1995
1995
A s e t B is called EXPSPACE-avoiding, i f e v ery subset of B in EXPSPACE is sparse. Sparse sets and sets of high information… (More)
Is this relevant?
1994
1994
  • 1994
A method to extract the cubes of the Generalized Reed-Muller form (GRM) of a Boolean function with a given polarity is presented… (More)
  • table 3
  • table 5
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1986
Highly Cited
1986
An algorithm is presented which finds (the size of) a maximum independent set of an n vertex graph in time O(2°.276”) ’ p lm… (More)
Is this relevant?