On the complexity of the marriage problem

DOI10.1016/0001-8708(72)90021-7MaRDI QIDQ2556860zbMATH OpenOpenAlexFDO

Authors Lawrence H. Harper, John Savage

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

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

Cites work

• Computational Work and Time on Finite Machines
• Computer Solutions of the Traveling Salesman Problem
• scientific article; zbMATH DE number 3425574 (Why is no real title available?)
• scientific article; zbMATH DE number 3145789 (Why is no real title available?)
• scientific article; zbMATH DE number 3257409 (Why is no real title available?)
• scientific article; zbMATH DE number 3356619 (Why is no real title available?)
• scientific article; zbMATH DE number 3370348 (Why is no real title available?)
• On the convergence of an integer‐programming process
• Systems of representatives

Cited in

(3)

• 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

This page was built for publication: On the complexity of the marriage problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2556860)