The following pages link to Berechnung und Programm. II (Q2559922):
Displaying 6 items.
- Some computational problems in linear algebra as hard as matrix multiplication (Q685718) (← links)
- Fast algorithms for the characteristic polynomial (Q1058849) (← links)
- A survey of techniques in applied computational complexity (Q1224857) (← links)
- Some elementary proofs of lower bounds in complexity theory (Q1245277) (← links)
- The Projective Noether Maple Package: Computing the dimension of a projective variety (Q1587230) (← links)
- On genuinely time bounded computations (Q5096139) (← links)
