2983 search results - page 130 / 597 » The group marriage problem |
181
click to vote
JSYML
2010
15 years 1 months ago
2010
We prove that any countable index, universally measurable subgroup of a Polish group is open. By consequence, any universally measurable homomorphism from a Polish group into the i...
176
click to vote
PAMI
2010
15 years 5 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
168
click to vote
PATAT
2000
Springer
15 years 10 months ago
2000
Springer
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a given period of time, satisfying a set of different constraints. There are a nu...
290
click to vote
MST
2011
14 years 9 months ago
2011
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...
182
click to vote
CSR
2009
Springer
16 years 1 months ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...