This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
N. Alon and J. Spencer, The Probabilistic Method, Wiley, New York (1991).
S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof verification and in-tractability of approximation problems, Proceedings of Annual IEEE Symposium on Foundations of Computer Science (1992), 14–23.
A. Blass and Y. Gurevich, Existential fixed-point logic, in: “Computation Theory and Logic” (E. Börger, Ed.), Lecture Notes in Computer Science Nr. 270, Springer 1987, 20–36.
B. Bollobás, Random graphs, Academic Press, London (1985).
K. Compton, 0–1 laws in logic and combinatorics, in: “NATO Advanced Study Institute on algorithms and Order”, (I. Rival, Ed), pp 353–383, Reidel, Dordrecht (1988).
R. Fagin, Generalized first-order spectra and polynomial time recognizable sets, Complexity of Computations, SIAM-AMS Proc. 7 (1974), Richard Karp, ed., American Math. Soc., Providence, RI, 43–73.
M. R. Garey and D. S. Johnson, Computers and Intractibility: A Guide the to the Theory of NP-Completeness, Freeman, New York (1979).
T. Hirst and D. Harel, Taking it to the Limit: On Infinite Variants of NP-Complete Problems, unpublished manuscript (1992).
N. Immerman, Relational Queries Computable in Polynomial Time, Information and Control 68 (1986), 86–104.
V. Kann, On the Approximability of NP-complete Optimization Problems, Dissertation (1992), Royal Institute of Technology, Stockholm.
Ph. Kolaitis and M. Thakur, Logical definability of NP optimization problems, 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 the probabilities of higher-order properties, Proceedings of 19th Annual ACM Symposium on Theory of Computing (1987), 425–435.
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, Informatik-Bericht Nr. 1/92, Institut für Informatik, Johannes Gutenberg-Universität Mainz (1992).
A. Panconesi and D. Ranjan, Quantifiers and approximation, Proceedings of 22nd Annual ACM Symposium on Theory of Computing (1990), 446–456.
Ch. Papadimitriou and M. Yannakakis, Optimization, approximation and complexity, Journal of Computer and System Sciences 43 (1991), 425–440.
Ch. Papadimitriou and M. Yannakakis, On the complexity of computing the V-C dimension, Extended Abstract (1992).
M. Vardi, Complexity of Relational Query Languages, Proc. of 14th Annual ACM Symposium on Theory of Computing (1982), 137–146.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Behrendt, T., Compton, K., Grädel, E. (1993). Optimization problems: Expressibility, approximation properties and expected asymptotic growth of optimal solutions. In: Börger, E., Jäger, G., Kleine Büning, H., Martini, S., Richter, M.M. (eds) Computer Science Logic. CSL 1992. Lecture Notes in Computer Science, vol 702. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56992-8_5
Download citation
DOI: https://doi.org/10.1007/3-540-56992-8_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56992-3
Online ISBN: 978-3-540-47890-4
eBook Packages: Springer Book Archive