The following pages link to STACS 2005 (Q5710699):
Displaying 10 items.
- The parallel complexity of graph canonization under abelian group action (Q378219) (← links)
- The number of steps for construction of a Boolean solution to polynomial congruences and systems of polynomial congruences (Q946013) (← links)
- The complexity of linear problems in fields (Q1103602) (← links)
- Complexity of solution of linear systems in rings of differential operators (Q1190952) (← links)
- A new class of the smallest FSSP partial solutions for 1D rings of length \(n=2^k-1\) (Q2041690) (← links)
- The complexity of solving low degree equations over ring of integers and residue rings (Q2319973) (← links)
- Algorithms for solving linear equations over associative rings with unit element (Q2668509) (← links)
- (Q3362348) (← links)
- (Q3973338) (← links)
- On the complexity of solving linear congruences and computing nullspaces modulo a constant (Q5414629) (← links)
