Sciweavers

729 search results - page 5 / 146
» And Or Hierarchies and Round Abstraction
Sort
View
WAOA
2005
Springer
92views Algorithms» more  WAOA 2005»
14 years 1 months ago
Rounding of Sequences and Matrices, with Applications
Abstract. We show that any real matrix can be rounded to an integer matrix in such a way that the rounding errors of all row sums are less than one, and the rounding errors of all ...
Benjamin Doerr, Tobias Friedrich, Christian Klein,...
CORR
2010
Springer
85views Education» more  CORR 2010»
13 years 7 months ago
An Effective Extension of the Wagner Hierarchy to Blind Counter Automata
Abstract. The extension of the Wagner hierarchy to blind counter automata accepting infinite words with a Muller acceptance condition is effective. We determine precisely this hier...
Olivier Finkel
CORR
2008
Springer
88views Education» more  CORR 2008»
13 years 7 months ago
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages
Abstract. The purpose of this paper is to provide efficient algorithms that decide membership for classes of several Boolean hierarchies for which efficiency (or even decidability)...
Christian Glasser, Heinz Schmitz, Victor L. Seliva...
ENTCS
2006
141views more  ENTCS 2006»
13 years 7 months ago
Abstract Families of Abstract Categorial Languages
Families of Categorial Languages Makoto Kanazawa 1 National Institute of Informatics Tokyo, Japan We show that the class of string languages generated by abstract categorial gramm...
Makoto Kanazawa
ASIACRYPT
2003
Springer
14 years 25 days ago
A New Attack against Khazad
Abstract. Khazad is a new block cipher initially proposed as a candidate to the NESSIE project. Its design is very similar to Rijndael, although it is a 64-bit block cipher. In thi...
Frédéric Muller