The following pages link to (Q3904048):
Displaying 5 items.
- A public key cryptosystem based on Diophantine equations of degree increasing type (Q740123) (← links)
- Complexity questions in number theory (Q1059094) (← links)
- On the zero-inequivalence problem for loop programs (Q1171383) (← links)
- On polynomial time isomorphisms of some new complete sets (Q1245571) (← links)
- Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy (Q5943088) (← links)