664 search results - page 47 / 133 » Some results for a class of generalized polynomials |
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We suggest an approach for the enumeration of minimal permutations having d descents which uses skew Young tableaux. We succeed in finding a general expression for the number of s...
LATA
2009
Springer
15 years 4 months ago
2009
Springer
We examine decision problems for various classes of convex languages, previously studied by Ang and Brzozowski under the name “continuous languages”. We can decide whether a la...
JAR
2006
14 years 9 months ago
2006
We use some recent techniques from process algebra to draw several conclusions about the well studied class of ping-pong protocols introduced by Dolev and Yao. In particular we sho...
CORR
2000
Springer
14 years 9 months ago
2000
Springer
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...
134
click to vote
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...