| Document Date: 2006-11-24 03:47:48
Open Document File Size: 202,09 KBShare Result on Facebook
Company Vazirani / Air Force Laboratory / RC (f ) Complexity O(N 1.585 log N ) O(N 1.585 log N ) O(N 1.585 log N ) LP LP / Bell Laboratories / Vf / Saks / Bernstein / O(N ) O(N 1.585 log N ) SDP LP / / Currency pence / / / IndustryTerm obvious algorithm / constant-factor approximation algorithm / query algorithm / polynomial-time algorithm / reviews simple algorithms / linear-time algorithm / dynamic programming algorithm / similar algorithm / subexponential-time approximation algorithm / / Organization Computer Science Division / Defense Advanced Research Projects Agency / National Science Foundation / UC Berkeley / Air Force Materiel Command / / Person SCOTT AARONSON / / Product Pentax K-x Digital Camera / t10 / / Technology constant-factor approximation algorithm / subexponential-time approximation algorithm / randomized algorithm / polynomial-time algorithm / similar algorithm / dynamic programming algorithm / caching / linear-time algorithm / query algorithm / / URL http /
SocialTag |
ALGORITHMS FOR BOOLEAN FUNCTION QUERY PROPERTIES SCOTT AARONSON∗ Abstract. We investigate efficient algorithms for computing Boolean function properties relevant to query complexity. Such properties include, for exampl