DC Field | Value | Language |
---|---|---|
dc.contributor.author | Choi, SS | ko |
dc.contributor.author | Jung, Kyomin | ko |
dc.contributor.author | Kim, JH | ko |
dc.date.accessioned | 2013-03-11T00:08:35Z | - |
dc.date.available | 2013-03-11T00:08:35Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2011-11 | - |
dc.identifier.citation | JOURNAL OF COMPUTER AND SYSTEM SCIENCES, v.77, pp.1039 - 1053 | - |
dc.identifier.issn | 0022-0000 | - |
dc.identifier.uri | http://hdl.handle.net/10203/97753 | - |
dc.description.abstract | A k-bounded pseudo-Boolean function is a real-valued function on {0, 1}(n) that can be expressed as a sum of functions depending on at most k input bits. The k-bounded functions play an important role in a number of areas including molecular biology, biophysics, and evolutionary computation. We consider the problem of finding the Fourier coefficients of k-bounded functions, or equivalently, finding the coefficients of multilinear polynomials on {-1, 1}(n) of degree k or less. Given a k-bounded function f with m non-zero Fourier coefficients for constant k, we present a randomized algorithm to find the Fourier coefficients of f with high probability in O(m logn) function evaluations. The best known upper bound was O(lambda(n, m)m log n), where lambda(n, m) is between n(1/2) and n depending on m. Our bound improves the previous bound by a factor of Omega(n(1/2)). It is almost tight with respect to the lower bound Omega(mlogn/logm). In the process, we also consider the problem of finding k-bounded hypergraphs with a certain type of queries under an oracle with one-sided error. The problem is of self interest and we give an optimal algorithm for the problem. (C) 2010 Elsevier Inc. All rights reserved. | - |
dc.language | English | - |
dc.publisher | ACADEMIC PRESS INC ELSEVIER SCIENCE | - |
dc.subject | EFFICIENT | - |
dc.subject | SPECTRUM | - |
dc.subject | GRAPHS | - |
dc.subject | DNF | - |
dc.title | Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions | - |
dc.type | Article | - |
dc.identifier.wosid | 000294833400007 | - |
dc.identifier.scopusid | 2-s2.0-80052341376 | - |
dc.type.rims | ART | - |
dc.citation.volume | 77 | - |
dc.citation.beginningpage | 1039 | - |
dc.citation.endingpage | 1053 | - |
dc.citation.publicationname | JOURNAL OF COMPUTER AND SYSTEM SCIENCES | - |
dc.contributor.localauthor | Jung, Kyomin | - |
dc.contributor.nonIdAuthor | Choi, SS | - |
dc.contributor.nonIdAuthor | Kim, JH | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Pseudo-Boolean function | - |
dc.subject.keywordAuthor | Fourier coefficients | - |
dc.subject.keywordAuthor | Graph finding | - |
dc.subject.keywordAuthor | Learning polynomials | - |
dc.subject.keywordAuthor | Linkage discovery | - |
dc.subject.keywordAuthor | Walsh analysis | - |
dc.subject.keywordPlus | EFFICIENT | - |
dc.subject.keywordPlus | SPECTRUM | - |
dc.subject.keywordPlus | GRAPHS | - |
dc.subject.keywordPlus | DNF | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.