Sciweavers

532 search results - page 17 / 107
» Graphically abelian groups
Sort
View
FFA
2006
116views more  FFA 2006»
13 years 9 months ago
Amorphic association schemes with negative Latin square-type graphs
Applying results from partial difference sets, quadratic forms, and recent results of Brouwer and Van Dam, we construct the first known amorphic association scheme with negative La...
James A. Davis, Qing Xiang
IPL
2006
118views more  IPL 2006»
13 years 9 months ago
Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
Stéphanie Delaune
ENDM
2007
89views more  ENDM 2007»
13 years 9 months ago
Homomorphisms and Polynomial Invariants of Graphs
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial. This connection enables us to extend the study to other important polynomial i...
Delia Garijo, Jaroslav Nesetril, M. P. Revuelta
STACS
2010
Springer
14 years 4 months ago
The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets
Using ε-bias spaces over F2, we show that the Remote Point Problem (RPP), introduced by Alon et al [APY09], has an NC2 algorithm (achieving the same parameters as [APY09]). We stu...
Vikraman Arvind, Srikanth Srinivasan
STACS
1999
Springer
14 years 2 months ago
On Quantum Algorithms for Noncommutative Hidden Subgroups
Quantum algorithms for factoring and finding discrete logarithms have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the ...
Mark Ettinger, Peter Høyer