𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of the marriage problem

✍ Scribed by L.H Harper; J.E Savage

Book ID
107709725
Publisher
Elsevier Science
Year
1972
Tongue
English
Weight
665 KB
Volume
9
Category
Article
ISSN
0001-8708

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Complexity of the Subpattern Problem
On Complexity of the Subpattern Problem
✍ Ahal, Shlomo; Rabinovich, Yuri πŸ“‚ Article πŸ“… 2008 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 292 KB
On the complexity of the pancake problem
On the complexity of the pancake problem
✍ Fuxiang Yu πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 249 KB

## Abstract We study the computational complexity of finding a line that bisects simultaneously two sets in the two‐dimensional plane, called __the pancake problem__, using the oracle Turing machine model of Ko. We also study the basic problem of bisecting a set at a given direction. Our main resul

On the complexity of the highway problem
On the complexity of the highway problem
✍ Elbassioni, Khaled; Raman, Rajiv; Ray, Saurabh; Sitters, RenΓ© πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 358 KB