Sciweavers

434 search results - page 43 / 87
» Monadic Bounded Algebras
Sort
View
CRYPTO
2008
Springer
165views Cryptology» more  CRYPTO 2008»
13 years 11 months ago
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
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...
Payman Mohassel, Enav Weinreb
AML
2005
104views more  AML 2005»
13 years 9 months ago
Weak theories of linear algebra
Abstract. We investigate the theories LA, LAP, LAP of linear algebra, which were originally defined to study the question of whether commutativity of matrix inverses has polysize F...
Neil Thapen, Michael Soltys
ORDER
2000
85views more  ORDER 2000»
13 years 9 months ago
Epimorphisms in Certain Varieties of Algebras
We prove a lemma which, under restrictive conditions, shows that epimorphisms in V are surjective if this is true for epimorphisms from irreducible members of V . This lemma is app...
Gunter Bruns, John Harding
TAPSOFT
1993
Springer
14 years 2 months ago
Exception Handling and Term Labelling
: We propose a new algebraic framework for exception handling which is powerful enough to cope with many exception handling features such that recovery, implicit propagation of exc...
Gilles Bernot, Pascale Le Gall
PODS
2006
ACM
95views Database» more  PODS 2006»
14 years 10 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...