2983 search results - page 170 / 597 » The group marriage problem |
162
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
We describe a fixed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism which has running time 2O(b) NO(1) , where the parameter b is the maximum size of the col...
177
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We study the problem of computing zigzag persistence of a sequence of homology groups and study a particular sequence derived from the levelsets of a real-valued function on a top...
202
click to vote
RTA
2005
Springer
16 years 2 days ago
2005
Springer
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
157
click to vote
BIRTHDAY
2003
Springer
15 years 12 months ago
2003
Springer
The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundament...
196
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...