2412 search results - page 26 / 483 » Which Problems Have Strongly Exponential Complexity |
IANDC
2007
13 years 9 months ago
2007
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provide...
ISAAC
1993
Springer
14 years 1 months ago
1993
Springer
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
ICFP
2007
ACM
14 years 9 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
ECCC
2007
13 years 9 months ago
2007
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
WG
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the...