6274 search results - page 252 / 1255 » Proofs, Programs, Processes |
143
click to vote
ACTAC
2002
15 years 6 months ago
2002
This paper describes a framework for handling bound variable renaming and substitution mathematically rigorously with the aim at the same time to stay as close as possible to huma...
130
click to vote
ANOR
2002
15 years 6 months ago
2002
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
146
click to vote
COMBINATORICS
2002
15 years 6 months ago
2002
An efficient and purely combinatorial algorithm for calculating products in arbitrary Coxeter groups is presented, which combines ideas of Fokko du Cloux and myself. Proofs are lar...
159
click to vote
ECCC
2002
15 years 6 months ago
2002
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
148
click to vote
TIT
2002
15 years 6 months ago
2002
An elementary proof of a basic uncertainty principle concerning pairs of representations of vectors in different orthonormal bases is provided. The result, slightly stronger than s...