13 search results - page 2 / 3 » On the Number of Perfect Matchings in Random Lifts |
IPCO
2010
13 years 6 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
BMCBI
2006
13 years 4 months ago
2006
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
COCO
1998
Springer
13 years 9 months ago
1998
Springer
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
CRYPTO
2001
Springer
13 years 9 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...