<--- Back to Details
First PageDocument Content
Mathematics / Cryptography / Algebra / Permutations / Polynomials / Computational complexity theory / Proof of knowledge / IP / Permutation matrix / SchwartzZippel lemma / NP / Permutation
Date: 2012-05-30 08:55:25
Mathematics
Cryptography
Algebra
Permutations
Polynomials
Computational complexity theory
Proof of knowledge
IP
Permutation matrix
SchwartzZippel lemma
NP
Permutation

Proofs of Restricted Shuffles Bj¨ orn Terelius and Douglas Wikstr¨om CSC KTH Stockholm, Sweden {terelius,dog}@csc.kth.se

Add to Reading List

Source URL: www.nada.kth.se

Download Document from Source Website

File Size: 254,55 KB

Share Document on Facebook

Similar Documents

Proofs of Restricted Shuffles Bj¨ orn Terelius and Douglas Wikstr¨om CSC KTH Stockholm, Sweden {terelius,dog}@csc.kth.se

Proofs of Restricted Shuffles Bj¨ orn Terelius and Douglas Wikstr¨om CSC KTH Stockholm, Sweden {terelius,dog}@csc.kth.se

DocID: 1qGom - View Document

Spectral Graph Theory and its Applications  out: September 9, 2004 Problem Set 1 Lecturer: Daniel A. Spielman

Spectral Graph Theory and its Applications out: September 9, 2004 Problem Set 1 Lecturer: Daniel A. Spielman

DocID: 1q0te - View Document

Gaussian Elimination with (Partial) Pivoting At the kth stage of Gaussian elimination: • Search the kth column on and below the diagonal for the largest entry.

Gaussian Elimination with (Partial) Pivoting At the kth stage of Gaussian elimination: • Search the kth column on and below the diagonal for the largest entry.

DocID: 1pHW0 - View Document

BinPackingViaDiscrepancyOfPermutations-talg.dvi

BinPackingViaDiscrepancyOfPermutations-talg.dvi

DocID: 1oGJn - View Document

ABOUT MANUSCRIPTS FOR IJ ITA

ABOUT MANUSCRIPTS FOR IJ ITA

DocID: 1oDyM - View Document