Sciweavers

1679 search results - page 12 / 336
» Strong order equivalence
Sort
View
APAL
2010
123views more  APAL 2010»
13 years 8 months ago
Cut elimination and strong separation for substructural logics: An algebraic approach
Abstract. We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existin...
Nikolaos Galatos, Hiroakira Ono
ICALP
2005
Springer
14 years 2 months ago
All Quantum Adversary Methods Are Equivalent
Abstract: The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spect...
Robert Spalek, Mario Szegedy
JCT
2010
92views more  JCT 2010»
13 years 7 months ago
Enumeration by kernel positions for strongly Bernoulli type truncation games on words
We find the winning strategy for a class of truncation games played on words. As a consequence of the present author’s recent results on some of these games we obtain new formul...
Gábor Hetyei
DCC
2007
IEEE
14 years 8 months ago
Planar polynomials for commutative semifields with specified nuclei
We consider the implications of the equivalence of commutative semifields of odd order and planar Dembowski-Ostrom polynomials. This equivalence was outlined recently by Coulter an...
Robert S. Coulter, Marie Henderson, Pamela Kosick
CADE
2010
Springer
13 years 9 months ago
Automating Security Analysis: Symbolic Equivalence of Constraint Systems
We consider security properties of cryptographic protocols, that are either trace properties (such as confidentiality or authenticity) or equivalence properties (such as anonymity ...
Vincent Cheval, Hubert Comon-Lundh, Stéphan...