Sciweavers

Share
12 search results - page 1 / 3
» Inverse Monoids: Decidability and Complexity of Algebraic Qu...
Sort
View
MFCS
2005
Springer
12 years 5 months ago
Inverse Monoids: Decidability and Complexity of Algebraic Questions
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
Markus Lohrey, Nicole Ondrusch
CORR
2010
Springer
151views Education» more  CORR 2010»
11 years 12 months ago
How to prevent type-flaw attacks on security protocols under algebraic properties
In this paper, we prove that type-tagging prevents type-flaw attacks on security protocols that use the Exclusive-OR operator as our main contribution. Our proof method is general ...
Sreekanth Malladi, Pascal Lafourcade
ISSAC
2007
Springer
131views Mathematics» more  ISSAC 2007»
12 years 6 months ago
Some recent progress in exact linear algebra and related questions
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
Gilles Villard
FCT
2007
Springer
12 years 6 months ago
The Quantum Query Complexity of Algebraic Properties
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
Sebastian Dörn, Thomas Thierauf
JCT
2007
122views more  JCT 2007»
11 years 11 months ago
h-Vectors of Gorenstein polytopes
We show that the Ehrhart h-vector of an integer Gorenstein polytope with a unimodular triangulation satisfies McMullen’s g-theorem; in particular it is unimodal. This result gen...
Winfried Bruns, Tim Römer
books