971 search results - page 136 / 195 » Approximate Satisfiability and Equivalence |
SODA
2010
ACM
15 years 9 months ago
2010
ACM
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
WIA
2009
Springer
15 years 6 months ago
2009
Springer
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic ļ¬nite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ļ...
113
click to vote
COCOON
2009
Springer
15 years 6 months ago
2009
Springer
Golumbic et al. [Discrete Applied Mathematics 154(2006) 1465-1477] deļ¬ned the readability of a monotone Boolean function f to be the minimum integer k such that there exists an ...
IWPEC
2009
Springer
15 years 6 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Mengerās theorem both proble...
SEMWEB
2009
Springer
15 years 6 months ago
2009
Springer
This paper suggests appropriate rules to set up ontology matching evaluations and for golden standard construction and use which can signiļ¬cantly improve the quality of the preci...