Computing and Combinatorics

DOI10.1007/11533719zbMath1128.11057OpenAlexW4376561447MaRDI QIDQ5717020

Zsuzsanna Lipták, Sebastian Böcker

Publication date: 11 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11533719

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Computer solution of Diophantine equations (11Y50) Data structures (68P05) The Frobenius problem (11D07)

Related Items (1)

Computational complexity of the original and extended diophantine Frobenius problem

This page was built for publication: Computing and Combinatorics