1092 search results - page 60 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
156
Voted
ISCC
2008
IEEE
16 years 7 days ago
2008
IEEE
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
178
click to vote
COCO
2007
Springer
16 years 21 hour 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...
169
click to vote
CONCUR
2009
Springer
16 years 13 days ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
172
click to vote
COCOON
2006
Springer
15 years 9 months ago
2006
Springer
We consider the problem of reconciling gene trees with a species tree based on the widely accepted Gene Duplication model from Goodman et al. Current algorithms that solve this pro...
137
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
This paper considers the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent o...