Sciweavers

434 search results - page 15 / 87
» Monadic Bounded Algebras
Sort
View
TIT
2008
130views more  TIT 2008»
13 years 9 months ago
Improving the Lower Bound on the Higher Order Nonlinearity of Boolean Functions With Prescribed Algebraic Immunity
Abstract. The recent algebraic attacks have received a lot of attention in cryptographic literature. The algebraic immunity of a Boolean function quantifies its resistance to the s...
Sihem Mesnager
DAGSTUHL
2006
13 years 11 months ago
Bounds and algebraic algorithms in differential algebra: the ordinary case
Marc Moreno Maza, Oleg Golubitsky, Marina V. Kondr...
CSL
2010
Springer
13 years 11 months ago
New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures
We present a new algorithm for model-checking weak monadic second-order logic on inductive structures, a class of structures of bounded clique width. Our algorithm directly manipul...
Tobias Ganzow, Lukasz Kaiser
APAL
2005
93views more  APAL 2005»
13 years 9 months ago
Logical aspects of Cayley-graphs: the group case
Abstract. We prove that a finitely generated group is context-free whenever its Cayleygraph has a decidable monadic second-order theory. Hence, by the seminal work of Muller and Sc...
Dietrich Kuske, Markus Lohrey
ECCC
2010
92views more  ECCC 2010»
13 years 8 months ago
Logspace Versions of the Theorems of Bodlaender and Courcelle
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
Michael Elberfeld, Andreas Jakoby, Till Tantau