193 search results - page 7 / 39 » Exponential lower bounds for the numbers of Skolem-type sequ... |
COLT
2006
Springer
13 years 11 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a planar graph G with n vertices. Using the transfer matrix method we construct a...
SPAA
2010
ACM
14 years 6 days ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...