522 search results - page 4 / 105 » On the Hardness of the Noncommutative Determinant |
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
It was proved by [Garey and Johnson, 1983] that computing the crossing number of a graph is an NP-hard problem. Their reduction, however, used parallel edges and vertices of very h...
TSD
2001
Springer
14 years 8 days ago
2001
Springer
In order to improve patients’ life conditions and to reduce the costs of long hospitalization, the medicine is more and more interested in the telemonitoring techniques. These wi...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
TIT
2011
13 years 2 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
WECWIS
2003
IEEE
14 years 1 months ago
2003
IEEE
Electronic exchanges are double-sided marketplaces that allow multiple buyers to trade with multiple sellers, with aggregation of demand and supply across the bids to maximize the...