Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

On the power of built-in relations in certain classes of program schemes.

Chauhan, S. R. and Stewart, I. A. (1999) 'On the power of built-in relations in certain classes of program schemes.', Information processing letters., 69 (2). pp. 77-82.

Abstract

We completely classify the relative expressibilities of the program schemes of NPS augmented with the built-in relations: linear order; addition; multiplication; and BIT. We employ pebble games allied with some number theory.

Item Type:Article
Keywords:Computational complexity, Descriptive complexity, Finite model theory, Program schemes.
Full text:PDF - Accepted Version (103Kb)
Status:Peer-reviewed
Publisher Web site:http://dx.doi.org/10.1016/S0020-0190(98)00196-3
Record Created:29 Jun 2009 15:20
Last Modified:09 Nov 2011 15:51

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Usage statisticsLook up in GoogleScholar | Find in a UK Library