68 search results - page 4 / 14 » cc 2010 |
CC
2010
Springer
13 years 2 months ago
2010
Springer
We show a general reduction that derives lower bounds on degrees of polynomial calculus proofs of tautologies over any field of characteristic other than 2 from lower bounds for r...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
TWC
2010
13 years 2 months ago
2010
In this paper we focus on resource allocation for next generation wireless communication systems with aggregation of multiple Component Carriers (CCs), i.e., how to assign the CCs ...
CC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
CC
2010
Springer
13 years 4 months ago
2010
Springer
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...