The following pages link to Gudmund Skovbjerg Frandsen (Q633625):
Displaying 25 items.
- (Q287136) (redirect page) (← links)
- Dynamic maintenance of majority information in constant time per update (Q287138) (← links)
- Dynamic normal forms and dynamic characteristic polynomial (Q633626) (← links)
- Dynamic matrix rank (Q843102) (← links)
- An extended quadratic Frobenius primality test with average- and worst-case error estimate (Q862420) (← links)
- Reviewing bounds on the circuit size of the hardest functions (Q1041784) (← links)
- (Q1186608) (redirect page) (← links)
- An arithmetic model of computation equivalent to threshold circuits (Q1186610) (← links)
- The computational efficacy of finite-field arithmetic (Q1210295) (← links)
- The computational complexity of some problems of linear algebra (Q1307698) (← links)
- Lower bounds for dynamic algebraic problems (Q1854488) (← links)
- On the density of normal bases in finite fields (Q1971063) (← links)
- Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers (Q2456564) (← links)
- Dynamic Normal Forms and Dynamic Characteristic Polynomial (Q3521938) (← links)
- A New GCD Algorithm for Quadratic Number Rings with Unique Factorization (Q3525745) (← links)
- Dynamic Matrix Rank (Q3613776) (← links)
- (Q3732937) (← links)
- (Q4265621) (← links)
- Some results on uniform arithmetic circuit complexity (Q4285623) (← links)
- On reducing a system of equations to a single equation (Q4657318) (← links)
- The computational complexity of some problems of linear algebra (Q5048945) (← links)
- Dynamic algorithms for the Dyck languages (Q5057425) (← links)
- Algorithmic Number Theory (Q5465644) (← links)
- Fundamentals of Computation Theory (Q5900790) (← links)
- Fundamentals of Computation Theory (Q5900791) (← links)
