162 search results - page 4 / 33 » Study of Lower Bound Functions for MAX-2-SAT |
COCO
2003
Springer
14 years 4 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
DAGSTUHL
2006
14 years 8 days ago
2006
We estimate Fourier coefficients of a Boolean function which has recently been introduced in the study of read-once branching programs. Our bound implies that this function has an...
GECCO
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
APPROX
2011
Springer
12 years 11 months ago
2011
Springer
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
ECCC
2010
13 years 9 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...