{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":13,"n_cols":5,"rows_kept":13,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[11,2,11,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996208797503316"]
[null,null,"Titolo",null,"2011 IEEE 26th Annual Conference on Computational Complexity"]
[null,null,"Pubbl/distr/stampa",null,"[Place of publication not identified], : IEEE, 2011"]
[null,null,"ISBN",null,"0-7695-4411-8"]
[null,null,"Descrizione fisica",null,"1 online resource (309 pages) : illustrations"]
[null,null,"Disciplina",null,"511.3"]
[null,null,"Soggetti",null,"Computational complexity"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,"Nota di contenuto",null,"Preface -- 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 "]
[{"$nulls":4},"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."]