971 search results - page 20 / 195 » Approximate Satisfiability and Equivalence |
TVLSI
2008
13 years 9 months ago
2008
Exact approaches to combinational equivalence checking, such as automatic test pattern generation-based, binary decision diagrams (BDD)-based, satisfiability-based, and hybrid appr...
RTA
2010
Springer
14 years 1 months ago
2010
Springer
This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-nee...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
SIAMCO
2010
13 years 8 months ago
2010
We consider linear-quadratic-Gaussian (LQG) games with a major player and a large number of minor players. The major player has a significant influence on others. The minor playe...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...