13603 search results - page 359 / 2721 » On the Computational Complexity of Cut-Reduction |
190
click to vote
DCC
2006
IEEE
16 years 7 months ago
2006
IEEE
We describe a low-complexity scheme for lossless compression of short text messages. The method uses arithmetic coding and a specific statistical context model for prediction of s...
213
click to vote
DCC
2004
IEEE
16 years 7 months ago
2004
IEEE
We present an algorithm for lossy compression of hyperspectral images for implementation on field programmable gate arrays (FPGA). To greatly reduce the bit rate required to code ...
145
click to vote
STACS
2010
Springer
16 years 2 months ago
2010
Springer
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...
172
click to vote
CSR
2009
Springer
16 years 2 months ago
2009
Springer
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
199
click to vote
IWPEC
2009
Springer
16 years 2 months ago
2009
Springer
We study the Hospitals/Residents with Couples problem, a variant of the classical Stable Marriage problem. This is the extension of the Hospitals/Residents problem where residents ...