ICALP
2009
Springer
15 years 12 days ago
2009
Springer
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
ICALP
2009
Springer
15 years 12 days ago
2009
Springer
In this paper, we show that for every constant 0 < < 1/2 and for every constant d 2, the minimum size of a depth d Boolean circuit that -approximates Majority function on n ...
STOC
2002
ACM
15 years 12 days ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
STOC
2004
ACM
15 years 12 days ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
STOC
2005
ACM
15 years 13 days ago
2005
ACM
We prove exponential lower bounds for the refutation of a random 3-CNF with linear number of clauses by k-DNF Resolution for k log n/ log log n. For this we design a specially ta...
RECOMB
2005
Springer
15 years 13 days ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
RECOMB
2008
Springer
15 years 13 days ago
2008
Springer
Since the discovery of the "Philadelphia chromosome" in chronic myelogenous leukemia in 1960, there is an ongoing intensive research of chromosomal aberrations in cancer....
TCC
2009
Springer
15 years 20 days ago
2009
Springer
The known secret-sharing schemes for most access structures are not efficient; even for a one-bit secret the length of the shares in the schemes is 2O(n) , where n is the number of...
ICDT
2009
ACM
15 years 25 days ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
ICML
2004
IEEE
15 years 28 days ago
2004
IEEE
A fast-growing body of research in the AI and machine learning communities addresses learning in games, where there are multiple learners with different interests. This research a...