2766 search results - page 180 / 554 » Algorithms for trigonometric polynomials |
221
click to vote
COCO
2011
Springer
14 years 6 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 ...
134
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
We study the compression of polynomially samplable sources. In particular, we give efficient prefix-free compression and decompression algorithms for three classes of such sources ...
146
click to vote
ACL
1994
15 years 7 months ago
1994
1 We examine the consistency problem for descriptions of trees based on remote dominance, and present a consistency-checking algorithm which is polynomial in the number of nodes in...
192
click to vote
COLOGNETWENTE
2010
15 years 5 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
141
click to vote
CSJM
2008
15 years 5 months ago
2008
Faug`ere's criterion used in the F5 algorithm is still not understand and thus there are not many implementations of this algorithm. We state its proof using syzygies to expl...