Computability of convex sets

DOI10.1007/3-540-59042-0_104MaRDI QIDQ4596652zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(10)

• On the computability of the set of automorphisms of the unit square
• Computable operators on regular sets
• scientific article; zbMATH DE number 5302815 (Why is no real title available?)
• scientific article; zbMATH DE number 1182920 (Why is no real title available?)
• scientific article; zbMATH DE number 1499089 (Why is no real title available?)
• Computability on Regular Subsets of Euclidean Space
• Semicomputable points in Euclidean spaces
• New Computational Paradigms
• Three concepts of decidability for general subsets of uncountable spaces
• Effectively open real functions

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)