Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions

Let g : {-1, 1} k → {-1, 1} be any Boolean function and q 1 , . . . , q k be any degree-2 polynomials over {-1, 1} n . We give a deterministic algorithm which, given as input explicit descriptions of g, q 1 , . . ., q k and an accuracy parameter ϵ > 0, approximates Pr x~ {-1, 1} n [g(sign(q 1 (x)...

Full description

Bibliographic Details

Published in:	2014 IEEE 29th Conference on Computational Complexity (CCC) pp. 229 - 240
Main Authors:	De, Anindya, Diakonikolas, Ilias, Servedio, Rocco A.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.06.2014
Subjects:	Approximate counting Approximation algorithms Approximation methods Calculus Covariance matrices derandomization Eigenvalues and eigenfunctions polynomial threshold function Polynomials Random variables
ISSN:	1093-0159
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!