Zusammenfassung
Ein Traum eines jeden Studenten, Doktoranden und Professors: Die Richtigkeit eines komplizierten Beweises zu verifizieren, ohne ihn mühselig Zeile für Zeile zu lesen und zu verstehen.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Schriftenverzeichnis
S. Arora (1994). Probabilistic checking of proofs and hardness of approximation problems. Dissertation, Department of Computer Science, Princeton University.
S. Arora und C. Lund (1996). Hardness of approximations. Erscheint in: Approximation Algorithms for NP-Hard Problems (ed. Dorit Hochbaum).
S. Arora, C. Lund, R. Motwani, M. Sudan und M. Szegedy (1992). Proof verification and intractability of approximation problems. Proc. 33rd IEEE Symp. on Foundations of Computer Science, 13–22.
L. Babai, L. Fortnow und C. Lund (1991). Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity 1, 3–40.
M. Bellare, O. Goldreich und M. Sudan (1995). Free bits, PCPs and nonapproximability–towards tight results. Proc. 36th IEEE Symp. on Foundations of Computer Science, 422–431.
U. Feige (1996). A threshold of ln n for approximating set cover. Erscheint in: Proc. 28th ACM Symp. on Theory of Computing.
U. Feige, S. Goldwasser, L. Lovász, S. Safra und M. Szegedy (1991). Approximating clique is almost NP-complete. Proc. 32nd IEEE Symp. on Foundations of Computer Science, 2–12.
J. Hastad (1996). Testing of the long code and hardness for clique. Erscheint in: Proc. 28th ACM Symp. on Theory of Computing.
J. Hâstad (1996a). Clique is hard to approximate within n1-ɛ (Preliminary version). Royal Institute of Technology, Schweden.
S. Hougardy, H. J. Prömel und A. Steger (1994). Probabilistically checkable proofs and their consequences for approximation algorithms. Discrete Mathematics 136, 175–223.
S. Khanna, R. Motwani, M. Sudan und U. Vazirani (1994). On syntactic versus computational views of approximability. Proc. 35th Symp. on Foundations of Computer Science, 819–830.
C. Papadimitriou und M. Yannakakis (1991). Optimization, approximation and complexity classes. Journal of Computer and System Sciences 43, 425–440.
I. Wegener (1993). Theoretische Informatik. B. G. Teubner, Stuttgart.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Prömel, H.J., Steger, A. (1996). Wie man Beweise verifiziert, ohne sie zu lesen. In: Wegener, I. (eds) Highlights aus der Informatik. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61012-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-61012-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64656-0
Online ISBN: 978-3-642-61012-7
eBook Packages: Springer Book Archive