173 search results - page 18 / 35 » A Proof of the Two-path Conjecture |
COMBINATORICS
2006
13 years 8 months ago
2006
In this paper we study inversions within restricted fillings of Young tableaux. These restricted fillings are of interest because they describe geometric properties of certain sub...
JSYML
2008
13 years 8 months ago
2008
Abstract. In this paper we study the metric spaces that are definable in a polynomially bounded ominimal structure. We prove that the family of metric spaces definable in a given p...
ORL
2008
13 years 8 months ago
2008
We consider polling systems with general service times and switch-over times, gated service at all queues and with general renewal arrival processes. We derive closed-form express...
ICFP
2003
ACM
14 years 8 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
DCC
2002
IEEE
14 years 8 months ago
2002
IEEE
We use methods of Mortimer [19] to examine the subcodes spanned by minimumweight vectors of the projective generalized Reed-Muller codes and their duals. These methods provide a p...