281 search results - page 11 / 57 » The Proof Complexity of Linear Algebra |
MFCS
2005
Springer
14 years 1 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...
WCC
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we discuss some methods of constructing frequency/time hopping (FH/TH) sequences over GF(pk ) by taking successive k-tuples of given sequences over GF(p). We are abl...
ISSAC
2007
Springer
14 years 2 months ago
2007
Springer
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their po...
CRYPTO
2008
Springer
13 years 9 months ago
2008
Springer
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
EUSFLAT
2007
13 years 9 months ago
2007
The paper is devoted to the investigation of imprecision indices, introduced in [7]. They are used for evaluation of uncertainty (or more exactly imprecision), which is contained ...