434 search results - page 30 / 87 » Monadic Bounded Algebras |
SODA
2010
ACM
14 years 7 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
IGPL
2011
13 years 4 months ago
2011
In this note we present a completion for the variety of bounded distributive quasi lattices, and, inspired by a well-known idea of L.L. Maksimova [14], we apply this result in prov...
SAGA
2009
Springer
14 years 4 months ago
2009
Springer
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
Let ( ) denote the maximum size of a -ary code of length and distance . We study the minimum asymptotic redundancy ( ) = log ( ) as grows while and are fixed. For any and 1, long a...
LICS
2006
IEEE
14 years 3 months ago
2006
IEEE
Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An importa...