On the Complexity of Matrix Rank and Rigidity.
- Published in:
- Theory of Computing Systems, 2010, v. 46, n. 1, p. 9, doi. 10.1007/s00224-008-9136-8
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2010 AND VI 46 AND IP 1
Results: 4
1
2
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
- Published in:
- Theory of Computing Systems, 2010, v. 46, n. 1, p. 143, doi. 10.1007/s00224-008-9160-8
- By:
- Publication type:
- Article
3
Equivalence Problems for Circuits over Sets of Natural Numbers.
- Published in:
- Theory of Computing Systems, 2010, v. 46, n. 1, p. 80, doi. 10.1007/s00224-008-9144-8
- By:
- Publication type:
- Article
4
Generic Complexity of Presburger Arithmetic.
- Published in:
- Theory of Computing Systems, 2010, v. 46, n. 1, p. 2, doi. 10.1007/s00224-008-9120-3
- By:
- Publication type:
- Article