199 search results - page 8 / 40 » Computationally and Algebraically Complex Finite Algebra Mem... |
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...
ICCS
2004
Springer
14 years 2 months ago
2004
Springer
The DisCAS system employs and interacts with multiple ELIMINOs distributed over the Internet to achieve a distributed-parallel computing environment. ELIMINO is a computer algebra ...
CP
2007
Springer
14 years 17 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 ...
TCS
2010
13 years 3 months ago
2010
Markovian process algebras, such as PEPA and stochastic -calculus, bring a powerful compositional approach to the performance modelling of complex systems. However, the models gen...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...