Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
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
Document Date: 2010-01-04 06:24:48
Open Document
File Size: 25,94 KB
Share Result on Facebook
Company
IBM /
/
Person
Vadim Tarin /
/
Position
Watson Research The author /
/
SocialTag
Matrix theory
Matrices
Permutations
Vandermonde matrix
Determinant
Matrix
Computing the permanent
Permanent
Alexandre-Théophile Vandermonde
Algebra