12 search results - page 1 / 3 » Inverse Monoids: Decidability and Complexity of Algebraic Qu... |
MFCS
2005
Springer
13 years 10 months ago
2005
Springer
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...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
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 ...
ISSAC
2007
Springer
13 years 10 months ago
2007
Springer
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...
FCT
2007
Springer
13 years 10 months ago
2007
Springer
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 ...
JCT
2007
13 years 4 months ago
2007
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...