Polynomial evaluation over finite fields: new algorithms and complexity bounds [forthcoming]

Elia, M, Rosenthal, J and Schipani, D, 2011. Polynomial evaluation over finite fields: new algorithms and complexity bounds [forthcoming]. Applicable Agebra in Engineering, Communication and Computing.

Full text not available from this repository.

Item Type:	Journal article
Publication Title:	Applicable Agebra in Engineering, Communication and Computing
Creators:	Elia, M., Rosenthal, J. and Schipani, D.
Date:	2011
Identifiers:	Number Type 10.1007/s00200-011-0160-6 DOI
Divisions:	Schools > School of Science and Technology
Record created by:	EPrints Services
Date Added:	09 Oct 2015 11:02
Last Modified:	23 Aug 2016 09:13
URI:	https://irep.ntu.ac.uk/id/eprint/21743

Actions (login required)

Edit View

Statistics

Views

Downloads