Sciweavers

359 search results - page 15 / 72
» On the number of chord diagrams
Sort
View
DAM
2008
67views more  DAM 2008»
13 years 8 months ago
Extended resolution simulates binary decision diagrams
We prove that binary decision diagrams [1] can be polynomially simulated by the extended resolution rule of [2]. More precisely, for any unsatisfiable formula , there exists an ex...
Nicolas Peltier
CORR
2011
Springer
157views Education» more  CORR 2011»
13 years 12 days ago
Orphan-Free Anisotropic Voronoi Diagrams
We describe conditions under which an appropriately-defined anisotropic Voronoi diagram of a set of sites in Euclidean space is guaranteed to be composed of connected cells in an...
Guillermo D. Cañas, Steven J. Gortler
IMCSIT
2010
13 years 6 months ago
On the implementation of public keys algorithms based on algebraic graphs over finite commutative rings
We will consider balanced directed graphs, i.e., graphs of binary relations, for which the number of inputs and number of outputs are the same for each vertex. The commutative diag...
Michal Klisowski, Vasyl Ustimenko
VLDB
2007
ACM
103views Database» more  VLDB 2007»
14 years 8 months ago
On the Production of Anorexic Plan Diagrams
A "plan diagram" is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. We have shown recently tha...
Harish D., Pooja N. Darera, Jayant R. Haritsa
AAAI
2008
13 years 11 months ago
Limits and Possibilities of BDDs in State Space Search
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...
Stefan Edelkamp, Peter Kissmann