4757 search results - page 101 / 952 » A Unique |
FUIN
2008
15 years 4 months ago
2008
We give an algorithmic solution in a simple combinatorial data of Birkhoff s type problem studied in [14], for the category repft(I, K[t]/(tm)) of filtered I-chains of modules over...
130
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Denotational semantics can be based on algebras with additional structure (order, metric, etc.) which makes it possible to interpret recursive specifications. It was the idea of El...
134
click to vote
DISOPT
2006
15 years 4 months ago
2006
This paper gives a sufficient condition for a combinatorial problem to be greedy-type-resistant, i.e. such that, on some instances of the problem, any greedy-type algorithm will o...
BSL
2007
15 years 4 months ago
2007
We present a characterization of supercompactness measures for ω1 in L(R), and of countable products of such measures, using inner models. We give two applications of this charact...
108
Voted
JCT
2008
15 years 4 months ago
2008
The enumeration of lattice paths in wedges poses unique mathematical challenges. These models are not translationally invariant, and the absence of this symmetry complicates both ...