Computability of convex sets

DOI10.1007/3-540-59042-0_104zbMATH Open1379.68326OpenAlexW1565377562MaRDI QIDQ4596652FDOQ4596652

Authors:

Publication date: 4 December 2017

Published in: STACS 95 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59042-0_104

Recommendations

• Computable operators on regular sets
• Computability on Regular Subsets of Euclidean Space
• New Computational Paradigms
• COMPUTING CONVEX HULLS BY AUTOMATA ITERATION
• Computability on subsets of Euclidean space. I: Closed and compact subsets

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Cited In (8)

• New Computational Paradigms
• Effectively open real functions
• Computable operators on regular sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computability on Regular Subsets of Euclidean Space
• Title not available (Why is that?)
• Three concepts of decidability for general subsets of uncountable spaces

This page was built for publication: Computability of convex sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596652)