Feebly secure cryptographic primitives∗ Edward A. Hirsch Olga Melanich Sergey I. Nikolenko

First Page		Document Content
Date: 2012-01-21 00:18:10 Computational complexity theory Linear algebra Matrix theory Matrix Circuit complexity Boolean circuit Circuit Invertible matrix Arithmetic circuit complexity Algebra Theoretical computer science Mathematics		Feebly secure cryptographic primitives∗ Edward A. Hirsch Olga Melanich Sergey I. Nikolenko Add to Reading List Source URL: logic.pdmi.ras.ru Download Document from Source Website File Size: 364,11 KB Share Document on Facebook

	Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits In memory of Wen-tsun Wu–Jean-Guillaume Dumas DocID: 1xUE0 - View Document
	1 Roadmap for the Development of a Linear Algebra Library for Exascale Computing SLATE: Software for Linear Algebra Targeting Exascale DocID: 1xUyc - View Document
	Recent Progress in Linear Algebra and Lattice Basis Reduction Gilles Villard CNRS, ENS de Lyon, INRIA, UCBL, Université de Lyon Laboratoire LIP DocID: 1xUmT - View Document
	3 Designing SLATE SLATE: Software for Linear Algebra Targeting Exascale Jakub Kurzak Panruo Wu DocID: 1xT5s - View Document
	9. Linear Algebra Po-Shen Loh CMU Putnam Seminar, Fall DocID: 1vrLR - View Document