53 search results - page 6 / 11 » latin 2010 |
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
We consider the relationship between size and depth for layered Boolean circuits, synchronous circuits and planar circuits as well as classes of circuits with small separators. In ...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
We consider the multiplication of a sparse N × N matrix A with a dense N × N matrix B in the I/O model. We determine the worst-case non-uniform complexity of this task up to a c...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
Abstract The LLL algorithm aims at finding a “reduced” basis of a Euclidean lattice. The LLL algorithm plays a primary role in many areas of mathematics and computer science. ...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
Binary relations are an important abstraction arising in a number of data representation problems. Each existing data structure specializes in the few basic operations required by ...