220 search results - page 4 / 44 » New degree bounds for polynomial threshold functions |
ESOP
2010
Springer
14 years 4 months ago
2010
Springer
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs. ...
COCO
1997
Springer
13 years 11 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
— We present a new type of oriented bounding surfaces, which is particularly well suited for shortest distance computations. The bounding surfaces are obtained by considering sur...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We give explicit constructions of epsilon nets for linear threshold functions on the binary cube and on the unit sphere. The size of the constructed nets is polynomial in the dime...
COCO
2007
Springer
14 years 1 months ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...