6045 search results - page 3 / 1209 » Computable Linearizations of Well-partial-orderings |
PPAM
2001
Springer
13 years 10 months ago
2001
Springer
This paper presents an overview of pARMS, a package for solving sparse linear systems on parallel platforms. Preconditioners constitute the most important ingredient in the solutio...
ICTCS
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
DAC
2009
ACM
13 years 10 months ago
2009
ACM
— Digital signal processing applications often require the computation of linear systems. These computations can be considerably expensive and require optimizations for lower pow...
STOC
1999
ACM
13 years 10 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
INFORMATICALT
2000
13 years 5 months ago
2000
It is well known that in linear programming, the optimal values of the dual variables can be interpreted as shadow prices (marginal values) of the right-hand side coefficients. How...