557 search results - page 12 / 112 » A Type-Coercion Problem in Computer Algebra |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be ...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
CRYPTO
2008
Springer
13 years 9 months ago
2008
Springer
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...
INFOVIS
2002
IEEE
14 years 14 days ago
2002
IEEE
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
TCS
2011
13 years 2 months ago
2011
We consider some Riordan arrays related to binary words avoiding a pattern p, which can be easily studied by means of an A-matrix rather than their A-sequence. Both concepts allow...