A faster algorithm for testing polynomial representability of functions over finite integer rings

Ashwin Guha, Ambedkar Dukkipati. A faster algorithm for testing polynomial representability of functions over finite integer rings. Theoretical Computer Science, 579:88-99, 2015. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.