Abstract
In this paper we extend recent work about logical criteria for approximation properties of optimization problems. We focus on the relationship between logical expressibility and expected asymptotic growth of optimal solutions on random inputs. This further develops a probabilistic approach due to Behrendt, Compton and Grädel showing that expected optimal solutions for any problem in the class Max ⌆1 grows essentially like a polynomial. We show that there is a similar result for Min F + II1, a syntactic class of minimization problems which provides a logical criterion for approximability. As a consequence, we show that some important problems do not belong to Min F +II1.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
N. Alon and J. Spencer, The Probabilistic Method, Wiley, New York, 1991.
Th. Behrendt, K. Compton and E. Grädel, Optimization Problems: Expressibility, Approximation Properties, and Expected Asymptotic Growth of Optimal Solutions, Computer Science Logic, 6th Workshop, CSL '92, San Miniato 1992, Selected Papers, vol. 702 of LNCS, Springer-Verlag, 1993, pp. 43–60.
B. Bollobás, Random Graphs, Academic Press, London, 1985.
K. Compton, 0-1 laws in logic and combinatorics, in NATO Adv. Study Inst. on Algorithms and Order, I. Rival, ed., D. Reidel, 1988, pp. 353–383.
K. Compton and E. Grädel, Logical definability of counting functions, submitted for publication.
R. Fagin, Generalized first-order spectra and polynomial time recognizable sets, in complexity of Computations, R. Karp, ed., vol. 7 of SIAM-AMS Proc., Providence, RI, 1974, American Math. Soc., pp. 43–73.
Ph. Kolaitis and M. Thakur, Logical definability of NP optimization problems, Technical Report UCSC-CRL-90-48, Computer and Information Sciences, University of California, Santa Cruz (1990), to appear in Information and Computation
Ph. Kolaitis and M. Thakur, Approximation properties of NP minimization classes, Proceedings of 6th IEEE Conference on Structure in Complexity Theory (1991), 353–366, to appear in Journal of Computer and System Sciences.
Ph. Kolaitis and M. Vardi, The decision problem for probabilities of higher order properties, in Proc. 19th ACM Symp. on Theory of Computing, New York, 1990, Association for Computing Machinery, pp. 446–456.
Ph. Kolaitis and M. Vardi, Infinitary logic and 0-1 laws, Information and Computation 98 (1992), 258–294.
C. Lautemann, Logical Definability of NP-Optimization Problems with Monadic Auxiliary Predicates, Computer Science Logic, 6th Workshop, CSL '92, San Miniato 1992, Selected Papers, vol. 702 of LNCS, Springer-Verlag, 1993, pp. 327–339.
Ch. Papadimitriou and M. Yannakakis, Optimization, approximation and complexity, Journal of Computer and System Sciences 43 (1991), 425–440.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grädel, E., Malmström, A. (1994). Approximable minimization problems and optimal solutions on random inputs. In: Börger, E., Gurevich, Y., Meinke, K. (eds) Computer Science Logic. CSL 1993. Lecture Notes in Computer Science, vol 832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049329
Download citation
DOI: https://doi.org/10.1007/BFb0049329
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58277-9
Online ISBN: 978-3-540-48599-5
eBook Packages: Springer Book Archive