caa a22 4500 475740467 CHVBK 20180406123458.0 cr unu---uuuuu 170329e20000901xx s 000 0 eng 10.1007/BF02674558 doi (NATIONALLICENCE)springer-10.1007/BF02674558 Algorithmic aspects of partial convexity [Elektronische Daten] [N. Metel'skii, V. Naidenko] A characterization ofC-semispaces of partial convexity is obtained. An estimate of the number ofC-semispaces in the case of finitely many directions of partial convexity is given. A polynomial algorithm for the enumeration ofC-semispaces is developed. The problem of recognizing approximations of partially convex hulls generated by intersections ofC-semispaces is proved to be NP-complete. Kluwer Academic/Plenum Publishers, 2000 semispace of partial convexity nationallicence partially convex hull nationallicence convex cone nationallicence algorithm rate nationallicence NP-completeness nationallicence computational complexity nationallicence Metel'skii N. Mathematics Institute, National Academy of Sciences of Belarus, Minsk aut Naidenko V. Mathematics Institute, National Academy of Sciences of Belarus, Minsk aut Mathematical Notes Kluwer Academic Publishers-Plenum Publishers 68/3(2000-09-01), 345-354 0001-4346 68:3<345 2000 68 11006 https://doi.org/10.1007/BF02674558 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF02674558 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Metel'skii N. Mathematics Institute, National Academy of Sciences of Belarus, Minsk aut NATIONALLICENCE 700 1- Naidenko V. Mathematics Institute, National Academy of Sciences of Belarus, Minsk aut NATIONALLICENCE 773 0- Mathematical Notes Kluwer Academic Publishers-Plenum Publishers 68/3(2000-09-01), 345-354 0001-4346 68:3<345 2000 68 11006 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer