On a query algorithm for a divisibility problem

DOI10.1145/1358183.1358186zbMATH Open1322.68276OpenAlexW2100755518MaRDI QIDQ5175698FDOQ5175698

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

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

Mathematics Subject Classification ID

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

Cited In (1)

• Title not available (Why is that?)

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)