6045 search results - page 274 / 1209 » Computable Linearizations of Well-partial-orderings |
232
click to vote
RTA
1997
Springer
15 years 11 months ago
1997
Springer
In the development of algorithms for finding the minimal solutions of systems of linear Diophantine equations, little use has been made (to our knowledge) of the results by Stanle...
167
click to vote
PARLE
1993
15 years 11 months ago
1993
: An arithmetic approach, such as the Level-Finding method described in this paper for evaluating linear recursive queries in deductive database systems provides great potential fo...
200
click to vote
PPSN
1992
Springer
15 years 11 months ago
1992
Springer
The limitations of linear chromosomes and conventional recombination operators are reviewed. It is argued that there are at least three classes of problems for which such represen...
214
click to vote
ERSHOV
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. We define the first nontrivial polynomially recognizable subclass of P-matrix Generalized Linear Complementarity Problems (GLCPs) with a subexponential pivot rule. No suc...
181
click to vote
STACS
2000
Springer
15 years 10 months ago
2000
Springer
We prove that several global properties (global convergence, global asymptotic stability, mortality, and nilpotence) of particular classes of discrete time dynamical systems are un...