LEADER 01067nam0-22003611i-450- 001 990007001770403321 005 20071126123607.0 010 $a88-14-02809-5 035 $a000700177 035 $aFED01000700177 035 $a(Aleph)000700177FED01 035 $a000700177 100 $a20011123d1991----km-y0itay50------ba 101 0 $aita 102 $aIT 105 $ay---n---001yy 200 1 $aAssistenza oggi$eprofili giuridici e organizzativi$fDaniela Gasparrini Pianesi 210 $aMilano$cGiuffrè$d1991 215 $a155 p.$d24 cm 225 1 $aPubblicazioni della Facoltà di Giurisprudenza$hSeconda serie$fUniversità di Macerata$v64 676 $a344.079$v20$zita 700 1$aGasparrini Pianesi,$bDaniela$0257606 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990007001770403321 952 $aUNIVERSITÀ 358 BIS (64)$b13624*$fFGBC 952 $aXXVIII 108$b1918$fDDCIC 952 $aVI B 618$b2207$fDDA 959 $aDDA 959 $aDDCIC 959 $aFGBC 996 $aAssistenza oggi$9699315 997 $aUNINA LEADER 03289oam 2200409zu 450 001 996208797503316 005 20210807001318.0 010 $a0-7695-4411-8 035 $a(CKB)2670000000097542 035 $a(SSID)ssj0000668984 035 $a(PQKBManifestationID)12310136 035 $a(PQKBTitleCode)TC0000668984 035 $a(PQKBWorkID)10703952 035 $a(PQKB)10858267 035 $a(NjHacI)992670000000097542 035 $a(EXLCZ)992670000000097542 100 $a20160829d2011 uy 101 0 $aeng 135 $aur||||||||||| 181 $ctxt 182 $cc 183 $acr 200 10$a2011 IEEE 26th Annual Conference on Computational Complexity 210 31$a[Place of publication not identified]$cIEEE$d2011 215 $a1 online resource (309 pages) $cillustrations 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a1-4577-0179-0 327 $aPreface -- Program Committee -- Steering Committee -- Reviewers -- Best Paper Awards -- Wednesday, 8 June 2011 -- Improved Direct Product Theorems for Randomized Query Complexity -- Making Branching Programs Oblivious Requires Superlogarithmic Overhead -- Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups -- Lower Bounds on Query Complexity for Testing Bounded-Degree CSPs -- Non-negatively Weighted #CSP: An Effective Complexity Dichotomy -- Symmetric LDPC Codes are not Necessarily Locally Testable -- Towards Lower Bounds on Locally Testable Codes via Density Arguments -- Linear-Algebraic List Decoding of Folded Reed-Solomon Codes -- Noisy Interpolation of Sparse Polynomials, and Applications -- Paris-Harrington Tautologies -- Relativized Separations of Worst-Case and Average-Case Complexities for NP -- Thursday, 9 June 2011 Non-uniform ACC Circuit Lower Bounds -- Improved Constructions of Three Source Extractors -- A New Approach to Affine Extractors and Dispersers -- Symmetry of Information and Bounds on Nonuniform Randomness Extraction via Kolmogorov Extractors -- Near-Optimal and Explicit Bell Inequality Violations -- Symmetry-Assisted Adversaries for Quantum State Generation -- Approximation Algorithms for QMA-Complete Problems -- Sevag Gharibian and Julia Kempe -- On Arthur Merlin Games in Communication Complexity -- On the Minimal Fourier Degree of Symmetric Boolean Functions -- Property Testing Lower Bounds via Communication Complexity -- Friday, 10 June 2011 Pseudorandomness for Permutation and Regular Branching Programs -- Pseudorandom Generators for Combinatorial Checkerboards -- Bounded-Depth Circuits Cannot Sample Good Codes -- k-Independent Gaussians Fool Polynomial Threshold Functions -- Explicit Dimension Reduction and Its Applications -- Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae -- Tensor Rank: Some Lower and Upper Bounds -- On the Sum of Square Roots of Polynomials and Related Problems -- Linear Systems over Finite Abelian Groups -- Author Index. 606 $aComputational complexity$vCongresses 615 0$aComputational complexity 676 $a511.3 702 $aIEEE Staff 801 0$bPQKB 906 $aPROCEEDING 912 $a996208797503316 996 $a2011 IEEE 26th Annual Conference on Computational Complexity$92346672 997 $aUNISA