Relationship between density and deterministic complexity of MP-complete languages

Publisher Website

1 January 1978

book chapter
Published by Springer Nature

p. 63-71
https://doi.org/10.1007/3-540-08860-1_6

Abstract

No abstract available

Keywords

This publication has 2 references indexed in Scilit:

Inclusion complete tally languages and the Hartmanis-Berman conjecture
Theory of Computing Systems, 1977
On isomorphisms and density of NP and other complete sets
Published by Association for Computing Machinery (ACM) ,1976