The complexity of approximately counting stable roommate assignments (Q440007): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1623719451 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1012.1237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Approximately Counting Stable Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Datalog and Bounded Path Duality of Relational Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative complexity of approximate counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: College Admissions and the Stability of Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Ferromagnetic Ising with Local Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the “stable roommates” problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Stable Marriages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of combinatorial structures from a uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Unapproximable Versions of $NP$-Complete Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:22, 5 July 2024

scientific article
Language Label Description Also known as
English
The complexity of approximately counting stable roommate assignments
scientific article

    Statements

    The complexity of approximately counting stable roommate assignments (English)
    0 references
    0 references
    0 references
    0 references
    17 August 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    approximate counting
    0 references
    roommate assignment problem
    0 references
    0 references
    0 references