Halfspace Matrices

. We introduce the notion of a halfspace matrix , which is a sign matrix A with rows indexed by linear threshold functions f , columns indexed by inputs x ∈ {− 1, 1} n , and the entries given by A f , x =  f ( x ). We use halfspace matrices to solve the following problems. In communication complexit...

Full description

Bibliographic Details

Published in:	Computational complexity Vol. 17; no. 2; pp. 149 - 178
Main Author:	Sherstov, Alexander A.
Format:	Journal Article
Language:	English
Published:	Basel SP Birkhäuser Verlag Basel 01.05.2008
Subjects:	Algorithm Analysis and Problem Complexity Computational Mathematics and Numerical Analysis Computer Science 68Q15 Linear threshold functions 68Q17 complexity of learning 03D15 complexity measures of sign matrices communication complexity
ISSN:	1016-3328, 1420-8954
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!