paddable
Jump to navigation
Jump to search
English[edit]
Etymology[edit]
Adjective[edit]
paddable (not comparable)
- (computing theory) Capable of being padded; said of a set whose strings can be transformed into infinitely many further strings in the set.
- 2015, Scott Aaronson, Shalev Ben-David, “Sculpting Quantum Speedups”, in arXiv[1]:
- Under a weaker assumption, that some problem in BQP is hard on average for P/poly, we show that every paddable language outside BPP is sculptable in this way.