Computability of convex sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 900, Issue , 1995, Pages 550-561

  Kummer, Martin ^a   Schäfer, Marcus ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY;

APPROXIMATE COMPUTATION; CHARACTERISTIC FUNCTIONS; COMPUTABLE SETS; CONVEX SET; INTERSECTION TEST;

SET THEORY;

EID: 21844518692     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-59042-0_104     Document Type: Conference Paper

References (19)

1. Manindra Agrawal, V. Arvind. Geometric sets of low information content. School of Mathematics, SPIC Science Foundation, Internal Report TCS-94-5, Madras, June 1994.
2. Patrick Assouad. Densitè et dimension. Ann. Inst. Fourier, Grenoble, 33,3:233-282, 1983.
3. R. Beigel, W. I. Gasarch, J. Gill, J. C. Owings, Jr. Terse, superterse, and verbose sets. Information and Computation, 103:68-85, 1993.
4. Richard Beigel, Martin Kummer, Frank Stephan. Approximable sets. In: Proceedings Structure in Complexity Theory. Ninth Annual Conference, pp.12-23, IEEE Computer Society Press, 1994.
5. Anselm Blumer, Andzej Ehrenfeucht, David Haussler, Manfred K. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. Journal of the Association for Computing Machinery, 36,4: 929-965, 1989.
6. Arne Brøndsted. An introduction to convex polytopes. Springer-Verlag, New York, 1983.
7. Richard Mansfield Dudley. A course on empirical processes. In: Ècole d'Ètè de Probabilitgs de Saint-Flour XII - 1982. Lecture Notes in Mathematics 1097, Springer-Verlag, Berlin, 2-142, 1984.
8. William I. Gasarch. Bounded queries in recursion theory: a survey. In: Proceedings Structure in Complexity Theory. Sizth Annual Conference, pp.62-78, IEEE Computer Society Press, 1991.
9. Xiaolin Ge, Anil Nerode. On extreme points of convex compact Turing located sets. In: Proceedings LFCS'94, St. Petersburg, Russia, July 1994, pp. 114-128, Lecture Notes in Computer Science Vol. 813, Springer-Verlag, Berlin, 1994.
10. Martin Grötschel, Làszlò Lovàsz, Alexander Schrijver. Geometric algorithms and combinatorial optimization. Springer-Verlag, Berlin, Heidelberg, 1988.
11. David Haussler, Emo Welzl. e-nets and simplex range queries. Discrete Cornput. Geometry, 2:127-151, 1987.
12. Konrad Jacobs. Extremalpunkte konvexer Mengen. In: Selecta Mathematiea 111, Springer-Verlag, Heidelberg, 1971.
13. Ker-I Ko. Complexity theory of real functions. Birkhäuser, Boston, 1991.
14. Jürg T. Marti. Konvexe Analysis. Birkhäuser Basel, 1977.
15. H. Minkowski. Gesammelte Abhandlungen, Bd. II. Teubner, Leipzig, 157-161, 1911.
16. Marian Boykan Pour-El, Jonathan Ian Richards. Computability in analysis and physics. Springer-Verlag, Berlin, 1989.
17. Marcus Schäfer Anfragekomplexität geometrischer Mengen. Diplomarbeit, Fakults für lnformatik, Universits Karlsruhe, January 1994.
18. V. N. Vapnik, A. Ya. Cervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl., 16:264-280, 1971.
19. R. S. Wencour, R. M. Dudley. Some special Vapnik-Chervonenkis classes. Discrete Mathematics, 33:313-318, 1981.