19320 search results - page 24 / 3864 » On the complexity of computing determinants |
114
Voted
ISAAC
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
89
Voted
WIA
2004
Springer
15 years 5 months ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
SOFSEM
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. The highway pricing problem asks for prices to be determined for segments of a single highway such as to maximize the revenue obtainable from a given set of customers wit...
94
Voted
ECBS
2005
IEEE
15 years 6 months ago
2005
IEEE
At the 2004 Engineering of Computer Based Systems (ECBS) Technical Committee meeting, the ECBS Executive Committee agreed that a guideline on Integrated System and Software Engine...
89
Voted
COCO
2005
Springer
15 years 6 months ago
2005
Springer
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...