1278 search results - page 17 / 256 » The Complexity of Weighted Boolean |
MST
2006
13 years 7 months ago
2006
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
FCS
2007
13 years 9 months ago
2007
Instances of the futile questioning problem abound in applications, especially, in the area of artificial intelligence. The problem can be represented by a particular quantified ...
ADBIS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The performance of an information retrieval system is usually measured in terms of two different criteria, precision and recall. This way, the optimization of any of its...
ASIACRYPT
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. We apply autocorrelation and Walsh coefficients for the investigation of correlation immune and resilient Boolean functions. We prove new lower bound for the absolute ind...