13603 search results - page 299 / 2721 » On the Complexity of Computing Treelength |
163
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
184
click to vote
CC
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
147
click to vote
IPL
2006
15 years 6 months ago
2006
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
131
click to vote
TSP
2008
15 years 6 months ago
2008
In this paper, we address the joint data-aided estimation of frequency offsets and channel coefficients in uplink MIMO-OFDMA systems. As the Maximum Likelihood (ML) estimator is i...
162
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...