Pages that link to "Item:Q5582354"
From MaRDI portal
The following pages link to On the Minimum Computation Time of Functions (Q5582354):
Displaying 24 items.
- Linear speed-up does not hold on Turing machines with tree storages (Q688445) (← links)
- On the universality of peptide computing (Q926519) (← links)
- Complexity lower bounds for machine computing models (Q1057651) (← links)
- Optimal dynamic embedding of X-trees into arrays (Q1105377) (← links)
- Indirect addressing and the time relationships of some models of sequential computation (Q1140427) (← links)
- Kolmogoroff algorithms are stronger than Turing machines (Q1147126) (← links)
- An information-theoretic approach to time bounds for on-line computation (Q1156484) (← links)
- On the sequential nature of functions (Q1232180) (← links)
- Fast on-line integer multiplication (Q1847139) (← links)
- Number theoretic transform: generalization, optimization, concrete analysis and applications (Q2057175) (← links)
- Fast NEON-based multiplication for lattice-based NIST post-quantum cryptography finalists (Q2118546) (← links)
- Fast multiplication of large numbers (Q2548172) (← links)
- Integer multiplication in time \(O(n\log n)\) (Q2662018) (← links)
- When NTT meets Karatsuba: preprocess-then-NTT technique revisited (Q2672460) (← links)
- Squeezing Feasibility (Q3188242) (← links)
- Real-time recognition of substring repetition and reversal (Q4120141) (← links)
- Derivation and Analysis of Fast Bilinear Algorithms for Convolution (Q5140608) (← links)
- Tensors in computations (Q5887832) (← links)
- Quantum circuits for high-degree and half-multiplication for post-quantum analysis (Q6547862) (← links)
- Survey number theoretic transform algorithm over a polynomial ring and its application (Q6610523) (← links)
- Implementing lattice-based PQC on resource-constrained processors: a case study for Kyber/Saber's polynomial multiplication on ARM Cortex-M0/M0+ (Q6623351) (← links)
- Algorithmic views of vectorized polynomial multipliers -- NTRU (Q6623353) (← links)
- Exploring the advantages and challenges of Fermat NTT in FHE acceleration (Q6652893) (← links)
- Space-efficient and noise-robust quantum factoring (Q6652983) (← links)
