198 search results - page 3 / 40 » Computing the Algebraic Immunity Efficiently |
CRYPTO
2008
Springer
13 years 10 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...
COMPGEOM
2001
ACM
14 years 5 days ago
2001
ACM
: Many geometric problems like generalized Voronoi diagrams, medial axis computations and boundary evaluation involve computation and manipulation of non-linear algebraic primitive...
CP
2007
Springer
14 years 14 days ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
JAT
2010
13 years 3 months ago
2010
We study the efficient numerical solution of infinite matrix equations Au = f for a matrix A in the Jaffard algebra. These matrices appear naturally via frame discretizations in m...