2661 search results - page 157 / 533 » Quantum Complexity Classes |
129
click to vote
WOLLIC
2010
Springer
15 years 8 months ago
2010
Springer
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider he...
221
Voted
INFOCOM
1997
IEEE
15 years 7 months ago
1997
IEEE
In this paper we present algorithms for flow admission control at an EDF link scheduler when the flows are characterized by peak rate, average rate and burst size. We show that th...
131
click to vote
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
120
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990'...
118
click to vote
RECOMB
2009
Springer
16 years 4 months ago
2009
Springer
Prediction and alignment of RNA pseudoknot structures are NP-hard. Nevertheless, several efficient prediction algorithms by dynamic programming have been proposed for restricted cl...