Sciweavers

434 search results - page 66 / 87
» Monadic Bounded Algebras
Sort
View
SCN
2004
Springer
102views Communications» more  SCN 2004»
14 years 3 months ago
On the Size of Monotone Span Programs
Abstract. Span programs provide a linear algebraic model of computation. Monotone span programs (MSP) correspond to linear secret sharing schemes. This paper studies the properties...
Ventzislav Nikov, Svetla Nikova, Bart Preneel
DAGSTUHL
2008
13 years 11 months ago
Complete Interval Arithmetic and its Implementation
: Let IIR be the set of closed and bounded intervals of real numbers. Arithmetic in IIR can be defined via the power set IPIR of real numbers. If divisors containing zero are exclu...
Ulrich W. Kulisch
FOSAD
2009
Springer
14 years 4 months ago
The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols
We introduce the Open-source Fixed-point Model Checker OFMC for symbolic security protocol analysis, which extends the Onthe-fly Model Checker (the previous OFMC). The native inpu...
Sebastian Mödersheim, Luca Viganò
CSR
2007
Springer
14 years 4 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
CSR
2007
Springer
14 years 4 months ago
On the Complexity of Matrix Rank and Rigidity
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...
Meena Mahajan, Jayalal M. N. Sarma