On the Minimum Computation Time of Functions

Cites work

Boolean Memories
Computability of Recursive Functions
Generation of Primes by a One-Dimensional Real-Time Iterative Array
scientific article; zbMATH DE number 3305097 (Why is no real title available?)
scientific article; zbMATH DE number 3322464 (Why is no real title available?)
Multiplikation großer Zahlen
On the Computational Complexity of Algorithms
On the Time Required to Perform Multiplication
One-tape, off-line Turing machine computations
Real time computation
The Theory of Automata, a Survey

Cited in

(30)

Complexity lower bounds for machine computing models
Optimal dynamic embedding of X-trees into arrays
Indirect addressing and the time relationships of some models of sequential computation
Kolmogoroff algorithms are stronger than Turing machines
An information-theoretic approach to time bounds for on-line computation
On the sequential nature of functions
Fast on-line integer multiplication
Number theoretic transform: generalization, optimization, concrete analysis and applications
Fast NEON-based multiplication for lattice-based NIST post-quantum cryptography finalists
Fast multiplication of large numbers
Integer multiplication in time \(O(n\log n)\)
When NTT meets Karatsuba: preprocess-then-NTT technique revisited
Squeezing Feasibility
Real-time recognition of substring repetition and reversal
Derivation and analysis of fast bilinear algorithms for convolution
Tensors in computations
Quantum circuits for high-degree and half-multiplication for post-quantum analysis
Survey number theoretic transform algorithm over a polynomial ring and its application
Implementing lattice-based PQC on resource-constrained processors: a case study for Kyber/Saber's polynomial multiplication on ARM Cortex-M0/M0+
Algorithmic views of vectorized polynomial multipliers -- NTRU
Exploring the advantages and challenges of Fermat NTT in FHE acceleration
Space-efficient and noise-robust quantum factoring
Space-efficient and noise-robust quantum factoring
Rhizomes and the roots of efficiency -- improving Prio
Linear speed-up does not hold on Turing machines with tree storages
The 1982 ACM Turing Award lecture. An overview of computational complexity
Symbolic mathematical computation 1965--1975. The view from a half-century perspective
Symbolic mathematical computation 1965--1975: the emergence of a discipline
AWE: Adaptive Weight Encoding for Exact Integer Matrix Products with Fewer GEMMs on FP4 Tensor Cores
On the universality of peptide computing

This page was built for publication: On the Minimum Computation Time of Functions

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