Bimonotone enumeration

DOI10.1090/S0025-5718-08-02162-5zbMath1214.11143arXiv0803.3273OpenAlexW3038092407MaRDI QIDQ3055111

Michael Eisermann

Publication date: 7 November 2010

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0803.3273

zbMATH Keywords

Diophantine equationsorting and searchingbimonotone enumerationbimonotone functionsemimonotone enumerationsorted enumeration

Mathematics Subject Classification ID

Searching and sorting (68P10) Computer solution of Diophantine equations (11Y50) Number-theoretic algorithms; complexity (11Y16) Parallel algorithms in computer science (68W10) Counting solutions of Diophantine equations (11D45) Higher degree equations; Fermat's equation (11D41)

Related Items (1)

Unnamed Item

Cites Work

• Enumerating solutions to 𝑝(𝑎)+𝑞(𝑏)=𝑟(𝑐)+𝑠(𝑑)
• Equal sums of four seventh powers
• Unsolved problems in number theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bimonotone enumeration