Pith. sign in

berkeley.edu/~wkahan/LOG10HAF.TXT

URL:https://people · 2005 · DOI 10.1109/arith.2005.32

1 Pith paper cite this work, alongside 16 external citations. Polarity classification is still indexing.

1 Pith paper citing it
16 external citations · OpenAlex
open at publisher browse 1 citing papers

fields

quant-ph 1

years

2026 1

verdicts

CONDITIONAL 1

representative citing papers

The table maker's quantum search

quant-ph · 2026-01-19 · conditional · novelty 6.0

Grover search can determine the hardness-to-round of elementary functions over all n-bit inputs in a binade in O~(2^{n/2}) time, an asymptotic speedup for periodic functions in large binades.

citing papers explorer

Showing 1 of 1 citing paper.

  • The table maker's quantum search quant-ph · 2026-01-19 · conditional · none · ref 2004

    Grover search can determine the hardness-to-round of elementary functions over all n-bit inputs in a binade in O~(2^{n/2}) time, an asymptotic speedup for periodic functions in large binades.