740 search results - page 61 / 148 » Lower bounds for Buchsbaum* complexes |
104
click to vote
EUROCRYPT
2012
Springer
13 years 2 months ago
2012
Springer
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
LATA
2009
Springer
15 years 6 months ago
2009
Springer
In this paper we investigate the computational complexity of knot theoretic problems and show upper and lower bounds for planarity problem of signed and unsigned knot diagrams repr...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
The paper contains comparisons of lower bound (potential) and achieved efficiency for filtering grayscale and color images corrupted by AWGN. It is demonstrated that for complex s...
COCOON
2007
Springer
15 years 6 months ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
101
click to vote
SIAMDM
2008
14 years 11 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...