bounded treewidth
On the read once property of branching programs and CNFs of bounded treewidth
... DNNF is a representation of Boolean functions well known in the areas of knowl- edge representation and databases. DNNF s are much more succinct than ROBP s. In fact a ROBP can be seen as a special case of DNNF [6] and ...
19
Hitting forbidden subgraphs in graphs of bounded treewidth
... the treewidth of the input graph and understanding how the running time has to depend on the ...of bounded treewidth, such as Courcelle’s Theorem, provide a unified and generic way of proving ...
14
On OBDDs for CNFs of bounded treewidth
... of bounded treewidth? The second question is: what is the space complexity of SDD parameterized by the incidence graph treewidth of the input CNF ...
10
Fixed parameter tractable canonization and isomorphism test for graphs of bounded treewidth
... than treewidth, already settling fixed-parameter tractability for them required many new ideas and considerable technical ...of bounded treewidth, the graph isomorphism problem is not trivial at ...
31
On OBDDs for CNFs of bounded treewidth
... of bounded treewidth? The second question is: what is the space complexity of SDD parameterized by the incidence graph treewidth of the input CNF ...
9
Learning Bounded Treewidth Bayesian Networks
... of bounded treewidth that addresses these ...is treewidth- friendly: the treewidth of the triangulated graph is guaranteed to increase by at most one when an edge is added to the Bayesian ...
33
On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth
... The above lower bound shows that c- nsobdd s are inherently different from sdd with respect to representation of cnf of bounded treewidth. Our second re- sult shows that this difference can, in fact, be ...
18
No small nondeterministic read once branching programs for CNFs of bounded treewidth
... A monotone 2- CNF s has clauses of the form (x ∨ y) where x and y are two dis- tinct variables. Such CNF s can be put in one-to-one correspondence with graphs that do not have isolated vertices. In particular, let G be ...
13
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms
... of treewidth w, but it was only recently that this running time was improved to 2 O(w) n O(1) , that is, to single-exponential parameterized by ...P, Bounded P -Block Vertex Deletion asks, given a graph G ...
13
Counting linear extensions: Parameterizations by treewidth
... Concluding the proof Let us summarize the fpt turing reduction used to prove The- orem 1. Given an instance (G, r) of Equitable Coloring [tw], we loop over all primes p such that 2r |V (G)| + r 2 |E(G)| < p < (2r ...
28
Solving d SAT via backdoors to small Treewidth
... small treewidth makes SAT polynomial time solv- able, it is very natural to ask about backdoors to a sub- solver on formulas of bounded ...of treewidth at most ...to treewidth at most t which ...
13
Reachability in High Treewidth Graphs
... of treewidth can range from 1 (for a tree) to n − 1 (for a complete graph on n ...for bounded treewidth ...for bounded treewidth ...has treewidth k ...to bounded ...
14
Can You Beat Treewidth?
... The second direction would be to generalize the results to constraints with higher arities. Theo- rem 1.3 is stated for binary CSP( G ), but this means that the negative result also holds for the more general problem ...
28
On the complexity of resource bounded logics
... In this paper, we establish formal relationships between model-checking problems for resource-bounded logics and decision problems for alternating VASS (also known as single-sided VASS). We then use these ...
14
Constructing bounded remainder sets and cut-and-project sets which are bounded distance to lattices
... To understand the connection between the above problems, first note that taking d = 1 in problem (i) essentially gives a reformulation of problem (ii) (i.e. with s = k − 1). Therefore solutions to problem (i) when d = 1 ...
12
Communication equilibria and bounded rationality
... admits bounded rationality generates similar phenomena (see [Geanakoplos, ...and bounded rationality, within the context of correlated ...of bounded rationality or ...
48
On Boosting with Polynomially Bounded Distributions
... we have certain family of “favorable” distributions (over X), and we say that a distribu- tion D is polynomially-close to the family if the infimum of the smoothness parameters of D w.r.t. the favorable family members is ...
24
Building Ethically Bounded AI
... AI/Humans Teams and IoT. Most existing approaches aim to build autonomous AI agents, but in real life agents will in- creasingly work together with humans. Preferences and eth- ical principles apply to teams of agents ...
5
Bounded Rationality and Bounded Reliability:A Study of Nonfamily Managers’ Entrepreneurial Behavior in Family Firms
... First, lack of control is a common motive limiting individuals’ information-processing capabilities and leading to illusory pattern perceptions (e.g., Whitson & Galinsky, 2008). Greater control perceptions can thus ...
36
BlinkDB: queries with bounded errors and bounded response times on very large data
... supports such bounds by maintaining multiple samples and employing a run-time sample selection module to select the appropriate sample type and size to meet a given query time or error b[r] ...
14