557 search results - page 10 / 112 » A Type-Coercion Problem in Computer Algebra |
FUIN
2010
13 years 6 months ago
2010
In this paper we present an application of the propositional SATisfiability environment to computing some simple orthogonal matrices and some interesting tasks in the area of cry...
JC
2007
13 years 7 months ago
2007
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
ECCC
2007
13 years 7 months ago
2007
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
FOCS
1990
IEEE
13 years 11 months ago
1990
IEEE
The first algebraic average-case complete problem is presented. It is arguably the simplest natural average-case complete problem to date.
ICCS
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we deal with performance analysis of Monte Carlo algorithm for large linear algebra problems. We consider applicability and efficiency of the Markov chain Monte Carlo...