706 search results - page 87 / 142 » On a quasi-ordering on Boolean functions |
163
click to vote
CCS
2006
ACM
15 years 10 months ago
2006
ACM
Privacy-preserving protocols allow multiple parties with private inputs to perform joint computation while preserving the privacy of their respective inputs. An important cryptogr...
198
click to vote
ECCC
2010
15 years 4 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
149
click to vote
ITC
2003
IEEE
15 years 11 months ago
2003
IEEE
A fault fj is said to dominate another fault fi if all tests for fi detect fj . When two faults dominate each other, they are called equivalent. Dominance and equivalence relation...
184
click to vote
CSCLP
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
158
click to vote
CHARME
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...