Subquadratic algorithms for succinct stable matching (Q2415371): Difference between revisions

From MaRDI portal
Merged Item from Q5740193
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4225298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric stable roommates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable matching with preferences derived from a psychological model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility / 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: A linear algorithm for determining the separation of convex polyhedra / 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: A Stable Marriage Requires Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient partition trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for the Stable Marriage Problem and Its Variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The communication requirements of social choice rules and supporting budget sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster all-pairs shortest paths via circuit complexity / rank
 
Normal rank

Revision as of 08:49, 12 July 2024

scientific article; zbMATH DE number 6605935
  • Subquadratic Algorithms for Succinct Stable Matching
Language Label Description Also known as
English
Subquadratic algorithms for succinct stable matching
scientific article; zbMATH DE number 6605935
  • Subquadratic Algorithms for Succinct Stable Matching

Statements

Subquadratic algorithms for succinct stable matching (English)
0 references
Subquadratic Algorithms for Succinct Stable Matching (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
21 May 2019
0 references
25 July 2016
0 references
0 references
0 references
0 references
0 references
0 references
0 references
stable matching
0 references
attribute model
0 references
subquadratic algorithms
0 references
conditional lower bound
0 references
seth
0 references
single-peaked preferences
0 references
conditional lower bounds
0 references
0 references
0 references
0 references