16666 search results - page 14 / 3334 » Descriptive and Computational Complexity |
CCCG
2009
13 years 5 months ago
2009
Motivated by the question of the polytopal realizability of the simplicial complex n,k of (k + 1)-crossing-free sets of diagonals of the convex n-gon, we study the first open case...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We study resolving conflicts between an action description and a set of conditions (possibly obtained from observations), in the context of action languages. In this form...
STACS
2000
Springer
13 years 11 months ago
2000
Springer
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
This paper investigates the design and application of the optimal filter banks for a predictioncompensated multiple description coding (PC-MDC) scheme, where the coefficients in e...
MOC
2010
13 years 2 months ago
2010
We find a system of two polynomial equations in two unknowns, whose solution allows us to give an explicit expression of the conformal representation of a simply connected three-sh...