9842 search results - page 128 / 1969 » The Complexity of the Matching-Cut Problem |
CORR
2007
Springer
13 years 10 months ago
2007
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
TC
2011
13 years 5 months ago
2011
— Processing the gathered information efficiently is a key functionality for wireless sensor networks. In this article, we study the time complexity, message complexity (number ...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
— The problem of designing high rate, full diversity noncoherent space-time block codes (STBCs) with low encoding and decoding complexity is addressed. First, the notion of g-gro...
CSMR
1998
IEEE
14 years 2 months ago
1998
IEEE
While it is widely agreed that architectural simplicity is a key factor to the success of large software systems, it is not obvious how to measure architectural complexity. Our ap...
STACS
2000
Springer
14 years 1 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...