The following pages link to Leonard M. Adleman (Q207153):
Displaying 42 items.
- On distinguishing prime numbers from composite numbers (Q594912) (← links)
- (Q762205) (redirect page) (← links)
- Primality testing and Abelian varieties over finite fields (Q1189509) (← links)
- Short permutation strings (Q1221115) (← links)
- (Q1243129) (redirect page) (← links)
- NP-complete decision problems for binary quadratics (Q1243130) (← links)
- Improved time and space bounds for Boolean matrix multiplication (Q1251068) (← links)
- A subexponential algorithm for discrete logarithms over hyperelliptic curves of large genus over \(\text{GF}(q)\) (Q1575856) (← links)
- Function field sieve method for discrete logarithms over finite fields (Q1854276) (← links)
- Efficient checkers for number-theoretic computations (Q1898116) (← links)
- Irreducibility Testing and Factorization of Polynomials (Q3043254) (← links)
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields (Q3137444) (← links)
- On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem (Q3332924) (← links)
- Combinatorial optimization problems in self-assembly (Q3579174) (← links)
- The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly (Q3654379) (← links)
- Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields (Q3716962) (← links)
- (Q3719832) (← links)
- Solving Bivariate Quadratic Congruences in Random Polynomial Time (Q3758905) (← links)
- (Q3808149) (← links)
- An $O(n^{1/10.89))$ Primality Testing Algorithm,$ (Q3898557) (← links)
- (Q3904048) (← links)
- Space-bounded simulation of multitape turing machines (Q3928247) (← links)
- An abstract theory of computer viruses (Q3972531) (← links)
- Inductive inference and unsolvability (Q3985087) (← links)
- A method for obtaining digital signatures and public-key cryptosystems (Q4145254) (← links)
- (Q4162483) (← links)
- (Q4224876) (← links)
- (Q4224877) (← links)
- Fast Checkers for Cryptography (Q4279600) (← links)
- (Q4341740) (← links)
- (Q4375592) (← links)
- Quantum Computability (Q4376180) (← links)
- (Q4664413) (← links)
- (Q4847910) (← links)
- (Q4847920) (← links)
- (Q4847935) (← links)
- (Q4847943) (← links)
- (Q4941233) (← links)
- (Q5075309) (← links)
- Running time and program size for self-assembled squares (Q5176033) (← links)
- The first case of Fermat's last theorem (Q5895496) (← links)
- Counting points on curves and Abelian varieties over finite fields (Q5945287) (← links)
