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

Guha, Ashwin and Dukkipati, Ashwin (2015) A faster algorithm for testing polynomial representability of functions over finite integer rings. In: THEORETICAL COMPUTER SCIENCE, 579 . pp. 88-99.

PDF the_com_sci-579_88_2015.pdf - Published Version Restricted to Registered users only Download (202kB) | Request a copy

Abstract

Given a function from Z(n) to itself one can determine its polynomial representability by using Kempner function. In this paper we present an alternative characterization of polynomial functions over Z(n) by constructing a generating set for the Z(n)-module of polynomial functions. This characterization results in an algorithm that is faster on average in deciding polynomial representability. We also extend the characterization to functions in several variables. (C) 2015 Elsevier B.V. All rights reserved.

Item Type:	Journal Article
Publication:	THEORETICAL COMPUTER SCIENCE
Publisher:	ELSEVIER SCIENCE BV
Additional Information:	Copy right for this article belongs to the ELSEVIER SCIENCE BV, PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
Keywords:	Polynomial functions; Finite integer rings; Kempner function
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	29 May 2015 05:38
Last Modified:	29 May 2015 05:38
URI:	http://eprints.iisc.ac.in/id/eprint/51601

Actions (login required)

View Item