2 search results - page 1 / 1 » Almost Tight Upper Bound for Finding Fourier Coefficients of... |
COLT
2008
Springer
13 years 6 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
AI
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...