1450 search results - page 44 / 290 » On the Complexity of Hardness Amplification |
122
click to vote
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
146
click to vote
FSTTCS
2010
Springer
14 years 12 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
209
Voted
ICDT
2009
ACM
16 years 2 months 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...
207
click to vote
POPL
2003
ACM
16 years 2 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
125
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...