On the computational complexity of the range computation problem

DOI10.1007/978-3-030-31041-7_15MaRDI QIDQ2215910zbMATH OpenOpenAlexFDO

Authors P. H. Hertling

Publication date 15 December 2020

Full work available at URL https://doi.org/10.1007/978-3-030-31041-7_15

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cited in

(2)

• On the Asaithambi-Zuhe-Moore algorithm for computing the range of values
• On the difficulty of range searching.

This page was built for publication: On the computational complexity of the range computation problem

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