Abstract
A subclass of the class of all pseudopolynomial problems is defined as a family of sets acceptable by some automaton operating with simultaneous time and space bounds. That the class is large enough can be seen in that it contains many (if not all) of the pseudopolynomial problems described in the literature. We study structure preserving reductions within this class and give intuitive reasons (borrowed from our knowledge about space bounded automata) that there exist at least four well known problems which are pairwise not equivalent under these reductions.
Some of this work was done while the author visited the department of Mathematics, University of California at Santa Barbara, where it was supported in part by the National Science Foundation under grant MCS 77 - 11360.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Ausiello, G., A. Marchetti-Spaccamela and M. Protasi, Toward a unified approach for the classification of NP-complete optimization problems, Proc. Frege-Conference 1979, Jena, GDR
Baker, B.S. and R.V. Book, Reversal-bounded multipushdown machines, J. Comp. Syst. Sci. 8 (1974), 315–332
Conway, R.W., W.L. Maxwell and L.W. Miller, Theory of Scheduling, Addison-Wesley, Reading, Mass., 1967
Cook, S.A. Characterizations of Pushdown Machines in Terms of Time-Bounded Computers, J. Ass. Comp. Mach. 18 (1971), 4–18
Garey, M.R. and D.S. Johnson, “Strong” NP-Completeness Results: Motivation, Examples and Implications, J.Ass. Comp. Mach. 25 (1978), 499–508
Garey, M.R. and D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-completeness, W.H. Freeman and Company, San Francisco, 1979
Monien, B,. Connections between the LBA problem and the knapsack problem, Proc. Frege-Conference 1979, Jena, GDR
Monien, B., Scheduling problems and space bounded computations, in preparation
Monien, B. and I.H. Sudborough, Bounding the bandwidth of NP-complete problems, in preparation
Paz, A. and S. Moran, Non-deterministic polynomial optimization problems and their approximation, Lecture Notes Comp. Sci. 52, 370–379, Springer Verlag Berlin-Heidelberg-New York, 1977
Sahni, S.K. Algorithms for Scheduling Independent Tasks, J.Ass. Comp. Mach. 23 (1976), 116–127
Savitch, W.J., Relationships between nondeterministic and deterministic tape complexities, J. Comp. Syst. Sci. 4(1970), 177–192
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Monien, B. (1980). On a subclass of pseudopolynomial problems. In: Dembiński, P. (eds) Mathematical Foundations of Computer Science 1980. MFCS 1980. Lecture Notes in Computer Science, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022521
Download citation
DOI: https://doi.org/10.1007/BFb0022521
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10027-0
Online ISBN: 978-3-540-38194-5
eBook Packages: Springer Book Archive