6274 search results - page 83 / 1255 » From query complexity to computational complexity |
145
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm Bisolve [3]. Bisolve is a classical elimination metho...
161
click to vote
LICS
2009
IEEE
16 years 25 days ago
2009
IEEE
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...
131
click to vote
GLOBECOM
2006
IEEE
16 years 7 days ago
2006
IEEE
— We investigate nonlinear precoding techniques for the downlink of multi-user systems from a transmitter equipped with multiple antennas to non-cooperative single antenna mobile...
138
click to vote
CONCUR
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We propose a polynomial-time decision procedure for hereditary history preserving bisimilarity (hhp-b) on Basic Parallel Processes (BPP). Furthermore, we give a sound and...
145
click to vote
PG
2003
IEEE
15 years 11 months ago
2003
IEEE
Interactive visualization of complex, real-world light sources has so far not been feasible. In this paper, we present an hardware accelerated direct lighting algorithm based on a...