NP-hard sets and creativeness over constant time languages

Agrawal, Manindra (1991) NP-hard sets and creativeness over constant time languages Lecture Notes in Computer Science, 560 . pp. 224-241. ISSN 0302-9743

Full text not available from this repository.

Official URL: http://www.springerlink.com/content/fgj216433442u7...

Related URL: http://dx.doi.org/10.1007/3-540-54967-6_71

Abstract

This article does not have an abstract.

Item Type:Article
Source:Copyright of this article belongs to Springer Berlin / Heidelberg.
ID Code:20257
Deposited On:20 Nov 2010 14:46
Last Modified:16 Jul 2012 04:43

Repository Staff Only: item control page