On a query algorithm for a divisibility problem

DOI10.1145/1358183.1358186MaRDI QIDQ5175698zbMATH OpenOpenAlexFDO

Authors Adrian Dumitrescu, Guangwu Xu

Publication date 24 February 2015

Published in ACM Communications in Computer Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1358183.1358186

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• On searching a table consistent with division poset
• The parity search problem
• Solution of Ulam's problem on searching with a lie
• scientific article; zbMATH DE number 123985
• On the number of queries necessary to identify a permutation

Cited in

(1)

• scientific article; zbMATH DE number 3843505 (Why is no real title available?)

This page was built for publication: On a query algorithm for a divisibility problem

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