ECCC 2011 - PDF Preprint Papers

ECCC 2011

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ECCC-2011 Paper

click to vote

ECCC
2011

323views ECommerce» more ECCC 2011»

A Linear-Optical Proof that the Permanent is #P-Hard

13 years 7 months ago

Download www.scottaaronson.com

Scott Aaronson

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	323	A Linear-Optical Proof that the Permanent is #P-Hard	claim
2	282	Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions	claim
3	234	On the complexity of computational problems regarding distributions (a survey)	claim
4	223	A Case of Depth-3 Identity Testing, Sparse Factorization and Duality	claim
5	223	A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation	claim
6	217	ReachFewL = ReachUL	claim
7	213	Extractors for circuit sources	claim
8	207	Balls and Bins: Smaller Hash Families and Faster Evaluation	claim
9	206	On the Degree of Univariate Polynomials Over the Integers	claim
10	205	Graphs of Bounded Treewidth can be Canonized in AC1	claim
11	204	Dense locally testable codes cannot have constant rate and distance	claim
12	203	Accelerated Slide- and LLL-Reduction	claim
13	203	The Advanced Encryption Standard, Candidate Pseudorandom Functions, and Natural Proofs	claim
14	202	New strong direct product results in communication complexity	claim
15	190	Optimal heuristic algorithms for the image of an injective function	claim
16	189	Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly	claim
17	188	Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length	claim
18	187	In Brute-Force Search of Correlation Bounds for Polynomials	claim
19	185	Property Testing Lower Bounds via Communication Complexity	claim
20	183	Extractors and Lower Bounds for Locally Samplable Sources	claim
21	180	Two Comments on Targeted Canonical Derandomizers	claim
22	171	Testing Linear Properties: Some general themes	claim
23	160	Robust Lower Bounds for Communication and Stream Computation	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers