165 search results - page 11 / 33 » Exotic Quantifiers, Complexity Classes, and Complete Problem... |
BMCBI
2006
13 years 7 months ago
2006
Background: Modelling the interaction between potentially antigenic peptides and Major Histocompatibility Complex (MHC) molecules is a key step in identifying potential T-cell epi...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...
MFCS
2004
Springer
14 years 23 days ago
2004
Springer
Given a fixed computable binary operation , we study the complexity of the following generation problem: The input consists of strings ½ Ò . The question is whether is in the c...
FSTTCS
1992
Springer
13 years 11 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
IANDC
1998
13 years 7 months ago
1998
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...