6045 search results - page 85 / 1209 » Computable Linearizations of Well-partial-orderings |
121
click to vote
MP
2006
15 years 4 months ago
2006
Abstract We give new error bounds for the linear complementarity problem where the involved matrix is a P-matrix. Computation of rigorous error bounds can be turned into a P-matrix...
140
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
157
click to vote
TIME
2007
IEEE
15 years 10 months ago
2007
IEEE
We present a proof searching technique for the natural deduction calculus for the propositional linear-time temporal logic and prove its correctness. This opens the prospect to ap...
121
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. A lexicographic ranking function for the set of all permutations of n ordered symbols translates permutations to their ranks in the lexicographic order of all permutation...
133
click to vote
WDAG
2007
Springer
15 years 10 months ago
2007
Springer
The paper presents a deterministic distributed algorithm that given an n node unweighted graph constructs an O(n3/2 ) edge 3-spanner for it in O(log n) time. This algorithm is the...