467 search results - page 73 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
116
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
125
click to vote
SIGECOM
2008
ACM
15 years 1 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
IPL
2007
15 years 1 months ago
2007
We prove that there is a polynomial time substitution (y1, . . . , yn) := g(x1, . . . , xk) with k << n such that whenever the substitution instance A(g(x1, . . . , xk)) of ...
121
click to vote
DAC
2004
ACM
16 years 2 months ago
2004
ACM
Efficient energy and performance estimation of embedded software is a critical part of any system-level design flow. Macromodeling based estimation is an attempt to speed up estim...
BMCBI
2007
15 years 1 months ago
2007
Background: Peptidases are proteolytic enzymes responsible for fundamental cellular activities in all organisms. Apparently about 2–5% of the genes encode for peptidases, irresp...