000020703 001__ 20703
000020703 005__ 20170119130207.0
000020703 04107 $$aeng
000020703 046__ $$k2014-09-22
000020703 100__ $$aKiktenko, Anastasia
000020703 24500 $$aInformational sensitivity as algorithm’s complexity function characteristic

000020703 24630 $$n11.$$pProceedings of the international conference on numerical analysis and applied mathematics 2014
000020703 260__ $$b
000020703 506__ $$arestricted
000020703 520__ $$2eng$$ainformational sensitivity, algorithm complexity, Travelling Salesman problem, Concorde.

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

000020703 7112_ $$aInternational conference on numerical analysis and applied mathematics 2014$$cRhodes (GR)$$d2014-09-22 / 2014-09-28$$gICNAAM2014
000020703 720__ $$aKiktenko, Anastasia$$iNikiforov, Konstantin$$iLunkovskiy, Mikhail
000020703 8560_ $$ffischerc@itam.cas.cz
000020703 8564_ $$s121788$$uhttps://invenio.itam.cas.cz/record/20703/files/450015_1.pdf$$yOriginal version of the author's contribution as presented on USB, paper 450015_1.pdf.
000020703 962__ $$r20333
000020703 980__ $$aPAPER