3454 search results - page 147 / 691 » Modern computer algebra |
166
click to vote
DCC
1998
IEEE
15 years 6 months ago
1998
IEEE
We discuss some methods for the enumeration, construction and random generation of isometry classes of block codes using methods from algebraic combinatorics.
206
click to vote
ESOP
2001
Springer
15 years 11 months ago
2001
Springer
Programmers rely on the correctness of the tools in their programming environments. In the past, semanticists have studied the correctness of compilers and compiler analyses, which...
164
click to vote
CCS
2006
ACM
15 years 10 months ago
2006
ACM
A high-level security policy states an overall requirement for a sensitive task. One example of a high-level security policy is a separation of duty policy, which requires a sensi...
183
click to vote
ICALP
2007
Springer
16 years 17 days 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...
222
click to vote
TCC
2007
Springer
16 years 16 days 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...