Time Bounded Frequency Computations

(1) We obtain two new results concerning the inclusion problem of polynomial time frequency classes with equal numbers of errors. 1.(m,m+d)P⊉(m+1,m+d+1)Pform<2d. 2.(m,m+d)P=(m+1,m+d+1)Pform⩾c(d) wherec(d) is large enough. This disproves a conjecture of Kinber. (2) We give a transparent proof of a...

Full description

Saved in:
Bibliographic Details
Published inInformation and computation Vol. 139; no. 2; pp. 234 - 257
Main Authors Hinrichs, Maren, Wechsung, Gerd
Format Journal Article
LanguageEnglish
Published San Diego, CA Elsevier Inc 15.12.1997
Elsevier
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Theoretical computing
Computational complexity
Algorithms
Polynomial time
Online AccessGet full text

Cover

More Information
Summary:(1) We obtain two new results concerning the inclusion problem of polynomial time frequency classes with equal numbers of errors. 1.(m,m+d)P⊉(m+1,m+d+1)Pform<2d. 2.(m,m+d)P=(m+1,m+d+1)Pform⩾c(d) wherec(d) is large enough. This disproves a conjecture of Kinber. (2) We give a transparent proof of a generalization of Kinber's result that there exist arbitrarily complex problems admitting a polynomial time frequency computation. Several corollaries provide more insight into the structure of the hierarchy of polynomial time frequency classes. (3) The relationships between polynomial time frequency classes and selectivity classes are studied.
ISSN:0890-5401
1090-2651
DOI:10.1006/inco.1997.2666