The complexity of two problems on arithmetic circuits

Pascal Koiran, Sylvain Perifel. The complexity of two problems on arithmetic circuits. Theoretical Computer Science, 389(1-2):172-181, 2007. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.

  翻译: