Abstract: Boolean satisfiability (SAT), the first proven nondeterministic polynominal-complete problem, is crucial in dataintensive applications. Different applications have a wide spectrum of SAT ...
Abstract: The problem of estimating the Fourier spectra of Boolean functions using noisy non-uniformly drawn random examples is considered. In particular, arbitrary product distributions on the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results