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...

Celý popis

Podrobná bibliografia

Vydané v:	Computational complexity Ročník 17; číslo 2; s. 149 - 178
Hlavný autor:	Sherstov, Alexander A.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Basel SP Birkhäuser Verlag Basel 01.05.2008
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!