000021127 001__ 21127
000021127 005__ 20170119130224.0
000021127 04107 $$aeng
000021127 046__ $$k2014-09-22
000021127 100__ $$aGorbenko, Anna
000021127 24500 $$aThe discrete minimum constraint removal motion planning problem

000021127 24630 $$n11.$$pProceedings of the international conference on numerical analysis and applied mathematics 2014
000021127 260__ $$b
000021127 506__ $$arestricted
000021127 520__ $$2eng$$amotion planning; NP-complete; satisfiability problem; satisfiability algorithms

000021127 540__ $$aText je chráněný podle autorského zákona č. 121/2000 Sb.
000021127 653__ $$a

000021127 7112_ $$aInternational conference on numerical analysis and applied mathematics 2014$$cRhodes (GR)$$d2014-09-22 / 2014-09-28$$gICNAAM2014
000021127 720__ $$aGorbenko, Anna$$iPopov, Vladimir
000021127 8560_ $$ffischerc@itam.cas.cz
000021127 8564_ $$s76220$$uhttps://invenio.itam.cas.cz/record/21127/files/850043_1.pdf$$yOriginal version of the author's contribution as presented on USB, paper 850043_1.pdf.
000021127 962__ $$r20333
000021127 980__ $$aPAPER