11 search results - page 2 / 3 » Enumeration problems for classes of self-similar graphs |
FOCS
2007
IEEE
14 years 2 days ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
CSL
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. A longstanding open problem is whether there exists a nonsyntactical model of the untyped -calculus whose theory is exactly the least -theory . In this paper we investiga...
UC
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
BMCBI
2010
13 years 5 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...