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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q128135731, #quickstatements; #temporary_batch_1722633721812
 
(8 intermediate revisions by 6 users not shown)
aliases / en / 0aliases / en / 0
 
Subquadratic Algorithms for Succinct Stable Matching
description / endescription / en
scientific article
scientific article; zbMATH DE number 6605935
Property / title
 
Subquadratic Algorithms for Succinct Stable Matching (English)
Property / title: Subquadratic Algorithms for Succinct Stable Matching (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1475.68476 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-34171-2_21 / rank
 
Normal rank
Property / published in
 
Property / published in: Computer Science – Theory and Applications / rank
 
Normal rank
Property / publication date
 
25 July 2016
Timestamp+2016-07-25T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 25 July 2016 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6605935 / rank
 
Normal rank
Property / zbMATH Keywords
 
conditional lower bounds
Property / zbMATH Keywords: conditional lower bounds / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2923170735 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3098709746 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1510.06452 / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: Efficient searching with linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of stable roommate matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models of greedy algorithms for graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ms. Machiavelli and the Stable Matching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Fast Algorithms for Four Problems in Stable Marriage / 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: On-line algorithms for weighted bipartite matching and stable marriages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cheating strategies for the Gale-Shapley algorithm with complete preference lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Economics of Matching: Stability and Incentives / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cores and indivisibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5368736 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128135731 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:25, 2 August 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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references