Publisher： Springer Publishing Company
Founded in： 1991
Total resources： 5
E-ISSN： 1420-8954
ISSN： 1016-3328
Subject： O29 applied mathematics
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
computational complexity
Menu
Special Issue: “Conference on Computational Complexity 2007” Guest Editor's Foreword
computational complexity , Vol. 17, Iss. 2, 2008-05 , pp.
Access to resources
Recommend
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems
computational complexity , Vol. 17, Iss. 2, 2008-05 , pp.Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
computational complexity , Vol. 17, Iss. 2, 2008-05 , pp.Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
computational complexity , Vol. 17, Iss. 2, 2008-05 , pp.Basis Collapse in Holographic Algorithms
By Cai Jin-Yi,Lu Pinyan in (2008)
computational complexity , Vol. 17, Iss. 2, 2008-05 , pp.Limits on the Hardness of Lattice Problems in
By Sherstov Alexander in (2008)
computational complexity , Vol. 17, Iss. 2, 2008-05 , pp.Polynomial Identity Testing for Depth 3 Circuits
computational complexity , Vol. 16, Iss. 2, 2007-05 , pp.Every Linear Threshold Function has a Low-Weight Approximator
computational complexity , Vol. 16, Iss. 2, 2007-05 , pp.Special Issue “Conference on Computational Complexity 2006” Guest Editors' Foreword
By Guruswami Venkatesan in (2007)
computational complexity , Vol. 16, Iss. 2, 2007-05 , pp.
Previous
Next