129 search results - page 23 / 26 » Lower Bounds for Testing Triangle-freeness in Boolean Functi... |
110
click to vote
COLT
2001
Springer
15 years 4 months ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
102
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
109
click to vote
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
121
click to vote
ALT
2010
Springer
14 years 11 months ago
2010
Springer
This paper is concerned with the combinatorial structure of concept classes that can be learned from a small number of examples. We show that the recently introduced notion of recu...
112
click to vote
ICLP
2010
Springer
2010
Springer
A Framework for Verification and Debugging of Resource Usage Properties: Resource Usage Verification
14 years 9 months ago
We present a framework for (static) verification of general resource usage program properties. The framework extends the criteria of correctness as the conformance of a program to ...