2430 search results - page 272 / 486 » Computing Tutte Polynomials |
164
click to vote
ICDCSW
2002
IEEE
15 years 9 months ago
2002
IEEE
In this paper we focus on the design of high performance peer-to-peer content sharing systems. In particular, our goal is to achieve global load balancing and short user-request r...
136
Voted
CPM
2010
Springer
15 years 8 months ago
2010
Springer
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...
118
Voted
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...
175
Voted
RANDOM
2001
Springer
15 years 8 months ago
2001
Springer
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨© ¤¥ ¦ §¨ belongs to a certain class of Boolean functions or whether it is far from the...
127
click to vote
STACS
2001
Springer
15 years 8 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...