<--- 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

Monotone Batch NP-Delegation with Applications to Access Control Zvika Brakerski∗ Yael Tauman Kalai†

Monotone Batch NP-Delegation with Applications to Access Control Zvika Brakerski∗ Yael Tauman Kalai†

DocID: 1xUdf - View Document

Lecture 25, Thurs April 20: Hamiltonians Now we’ll move on to our second-to-last unit… Hamiltonians and the Adiabatic Algorithm We’ve seen how it’s an open question whether quantum computers can solve ​NP​-co

Lecture 25, Thurs April 20: Hamiltonians Now we’ll move on to our second-to-last unit… Hamiltonians and the Adiabatic Algorithm We’ve seen how it’s an open question whether quantum computers can solve ​NP​-co

DocID: 1xTKi - View Document

PDF Document

DocID: 1xSVG - View Document

PDF Document

DocID: 1xSM6 - View Document

PDF Document

DocID: 1xSJs - View Document