19320 search results - page 337 / 3864 » On the complexity of computing determinants |
220
click to vote
FSTTCS
2005
Springer
16 years 8 days ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
186
Voted
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
Researchers are currently investigating applying benefit, or utility functions for allocating resources in limited, soft real time systems [1,2,3]. While the future of real -time ...
191
click to vote
WG
2001
Springer
15 years 11 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
271
click to vote
ISSAC
1997
Springer
15 years 11 months ago
1997
Springer
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
182
Voted
ICDCN
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbou...