612 search results - page 7 / 123 » Hardness assumptions in the foundations of theoretical compu... |
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In many contexts, one is confronted with the problem of extracting information from large amounts of different types soft data (e.g., text) and hard data (from e.g., physics-based...
CCA
2009
Springer
14 years 2 months ago
2009
Springer
d Abstract) Robert Rettinger1 Department of Mathematics and Computer Science University of Hagen, Germany Abstract. We show that under reasonable assumptions there exist Riemann ma...
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
We initiate the study of testing properties of images that correspond to sparse 0/1-valued matrices of size n