1730 search results - page 113 / 346 » Algebra and Computation |
122
Voted
CP
2000
Springer
15 years 7 months ago
2000
Springer
The ability to reduce either the number of variables or clauses in instances of the Satisfiability problem (SAT) impacts the expected computational effort of solving a given instan...
141
Voted
DAGSTUHL
2006
15 years 4 months ago
2006
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...
143
Voted
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
179
Voted
TCC
2007
Springer
15 years 9 months ago
2007
Springer
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
140
Voted
SMA
2008
ACM
15 years 3 months ago
2008
ACM
An algorithm and implementation is presented to compute the exact arrangement induced by arbitrary algebraic surfaces on a parametrized ring Dupin cyclide. The family of Dupin cyc...