7106 search results - page 81 / 1422 » Restricted Complexity, General Complexity |
IJAR
2008
13 years 10 months ago
2008
This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without and with independence. We then consider g...
PPAM
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...
COCOON
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
ICCD
1997
IEEE
14 years 2 months ago
1997
IEEE
In this paper, we suggest a block-restricted sifting strategy which is based on the restriction of Rudell's sifting to certain blocks of variables. The application of this st...
CSR
2008
Springer
13 years 12 months ago
2008
Springer
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...