325 search results - page 39 / 65 » Proofs of Restricted Shuffles |
FSTTCS
2008
Springer
13 years 11 months ago
2008
Springer
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...
COMBINATORICS
2007
13 years 10 months ago
2007
Let λ be a partition, and denote by fλ the number of standard tableaux of shape λ. The asymptotic shape of λ maximizing fλ was determined in the classical work of Logan and S...
JC
2008
13 years 9 months ago
2008
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
JCC
2006
13 years 9 months ago
2006
: We present a computational protein design algorithm for finding low-energy sequences of fixed amino acid composition. The search algorithms used in protein design typically do no...
JFP
2006
13 years 9 months ago
2006
Confinement properties impose a structure on object graphs which can be used to enforce encapsulation properties. From a practical point of view, encapsulation is essential for bu...