Alexandre-Théophile Vandermonde

Results: 6



#Item
1Problem with Vadim Tarin’s NP=RP Proof Charanjit S. Jutla IBM Watson Research The author manages to show that computing the permanent over characteristic 3 of a matrix M can be reduced in polynomial time to computing t

Problem with Vadim Tarin’s NP=RP Proof Charanjit S. Jutla IBM Watson Research The author manages to show that computing the permanent over characteristic 3 of a matrix M can be reduced in polynomial time to computing t

Add to Reading List

Source URL: eccc.hpi-web.de

Language: English - Date: 2010-01-04 06:24:48
2The Cost of Accurate Numerical Linear Algebra or Can we evaluate polynomials accurately? James Demmel Mathematics and Computer Science

The Cost of Accurate Numerical Linear Algebra or Can we evaluate polynomials accurately? James Demmel Mathematics and Computer Science

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2004-07-03 15:09:40
3.  Towards accurate polynomial evaluation or When can Numerical Linear Algebra be done accurately?

. Towards accurate polynomial evaluation or When can Numerical Linear Algebra be done accurately?

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2005-07-02 08:27:53
4University of Kentucky  Lexington Department of Mathematics

University of Kentucky Lexington Department of Mathematics

Add to Reading List

Source URL: www.ms.uky.edu

Language: English - Date: 2004-08-09 13:33:15
5University of Kentucky  Lexington Department of Mathematics

University of Kentucky Lexington Department of Mathematics

Add to Reading List

Source URL: www.ms.uky.edu

Language: English - Date: 2005-04-25 08:53:31
6University of Kentucky  Lexington Department of Mathematics

University of Kentucky Lexington Department of Mathematics

Add to Reading List

Source URL: www.ms.uky.edu

Language: English - Date: 2004-10-22 13:08:43