6142 search results - page 365 / 1229 » The Complexity of Partition Functions |
180
click to vote
IANDC
2006
15 years 6 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
135
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Buhrman, Cleve and Wigderson gave a general communication protocol for block-composed functions f(g1(x1 , y1 ), · · · , gn(xn , yn )) by simulating a decision tree com...
153
Voted
STACS
2005
Springer
16 years 5 days ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
194
click to vote
RC
2007
15 years 6 months ago
2007
The search algorithm presented allows the CDF of a dependent variable to be bounded with 100%confidence,andallowsforaguaranteedevaluationof theerror involved.Thesereliabilitybound...
186
click to vote
FROCOS
2011
Springer
14 years 6 months ago
2011
Springer
One of the main shortcomings of the traditional methods for combining theories is the complexity of guessing the arrangement of the variables shared by the individual theories. Thi...