Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > FAITHFUL HOMOMORPHISMS:
Reports tagged with Faithful Homomorphisms:
TR18-212 | 26th December 2018
Prerona Chatterjee, Ramprasad Saptharishi

Constructing Faithful Homomorphisms over Fields of Finite Characteristic

Revisions: 1

We study the question of algebraic rank or transcendence degree preserving homomorphisms over finite fields. This concept was first introduced by Beecken, Mittmann and Saxena (Information and Computing, 2013), and exploited by them, and Agrawal, Saha, Saptharishi and Saxena (Journal of Computing, 2016) to design algebraic independence based identity tests ... more >>>




ISSN 1433-8092 | Imprint