93 search results - page 1 / 19 » Testing Quasigroup Identities using Product of Sequence |
DATESO
2010
13 years 2 months ago
2010
Non-associative quasigroups are well known combinatorial designs with many different applications. Many cryptographic algorithms based on quasigroups primitives have been published...
FSE
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
ECCC
2011
12 years 11 months ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
BIBM
2008
IEEE
13 years 11 months ago
2008
IEEE
Mapping B-cell epitopes plays an important role in vaccine design, immunodiagnostic tests, and antibody production. Because the experimental determination of B-cell epitopes is ti...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...