560 search results - page 46 / 112 » Multiplication by a Constant is Sublinear |
COCO
2011
Springer
12 years 7 months ago
2011
Springer
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m > 1 is an arbitrary constant. We prove: • NTIME[2n ...
MFCS
2009
Springer
14 years 2 months ago
2009
Springer
Let I be a finite set of integers and F be a finite set of maps of the form n → ki n + i with integer coefficients. For an integer base k ≥ 2, we study the k-recognizability ...
ESA
2001
Springer
14 years 17 days ago
2001
Springer
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
DAGSTUHL
2003
13 years 9 months ago
2003
Based on a concise domain analysis we develop a formal semantics of security protocols. Its main virtue is that it is a generic model, in the sense that it is parameterized over e...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We propose in this paper an exploratory analysis algorithm for functional data. The method partitions a set of functions into K clusters and represents each cluster by a simple pr...