39 search results - page 5 / 8 » On the Relation between SAT and BDDs for Equivalence Checkin... |
CORR
1999
Springer
13 years 7 months ago
1999
Springer
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
APLAS
2007
ACM
13 years 12 months ago
2007
ACM
: An Extended Abstract Alwen Tiu Computer Sciences Laboratory Australian National University Abstract. A notion of open bisimulation is formulated for the spi calculus, an extensio...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
A software design is often modeled as a collection of unified Modeling Language (UML) diagrams. There are different aspects of the software system that are covered by many differe...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
SIGMOD
1996
ACM
14 years 4 hour ago
1996
ACM
We investigate the problem of incremental maintenance of an SQL view in the face of database updates, and show that it is possible to reduce the total time cost of view maintenanc...