On the complexity of the marriage problem

DOI10.1016/0001-8708(72)90021-7zbMath0251.05004OpenAlexW2024254561MaRDI QIDQ2556860

John E. Savage, Lawrence H. Harper

Publication date: 1972

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0001-8708(72)90021-7

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Permutations, words, matrices (05A05)

Related Items

A class of Boolean functions with linear combinational complexity ⋮ Lower bounds for the size of expressions for certain functions in d-ary logic ⋮ A remark on the time complexity of the subtree problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computer Solutions of the Traveling Salesman Problem
• Computational Work and Time on Finite Machines
• On the convergence of an integer‐programming process
• Systems of representatives