Pubbl/distr/stampa	[Place of publication not identified], : I E E E, 2010
Descrizione fisica	1 online resource
Disciplina	511.3
Soggetto topico	Neural computers Molecular computers
ISBN	1-4244-6440-4
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Record Nr.	UNINA-9910140893103321

Pubbl/distr/stampa	Los Alamitos, California : , : Institute of Electrical and Electronics Engineers (IEEE), , 2013
Descrizione fisica	1 online resource (220 pages) : illustrations
Disciplina	511.3
Soggetto topico	Computational complexity Computer science
ISBN	0-7695-5045-2
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Altri titoli varianti	Computational Science and Its Applications
Record Nr.	UNISA-996280126303316

Pubbl/distr/stampa	Piscataway, NJ : , : IEEE, , 2013
Descrizione fisica	1 online resource (41 pages)
Disciplina	511.3
Soggetto topico	Computational complexity
ISBN	0-7695-4997-7
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Altri titoli varianti	2013 IEEE Conference on Computational Complexity Computational Complexity
Record Nr.	UNISA-996280134603316

Pubbl/distr/stampa	[Place of publication not identified], : IEEE, 2011
Descrizione fisica	1 online resource (309 pages) : illustrations
Disciplina	511.3
Soggetto topico	Computational complexity
ISBN	0-7695-4411-8
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	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 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.
Record Nr.	UNISA-996208797503316

Pubbl/distr/stampa	[Place of publication not identified], : IEEE, 2011
Descrizione fisica	1 online resource (309 pages) : illustrations
Disciplina	511.3
Soggetto topico	Computational complexity
ISBN	0-7695-4411-8
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	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 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.
Record Nr.	UNINA-9910141130303321