Seriya knig s obshchim nazvaniem "Algoritmicheskie problemy algebry, bioinformatiki i robototekhniki" posvyashchena sistematicheskomu izlozheniyu algoritmicheskikh problem algebry, bioinformatiki i robototekhniki, v kotorom za osnovu vzyato nalichie obshchnosti kombinatornykh idey v trekh rassmatrivaemykh oblastyakh. Pri glubokom izuchenii algoritmicheskikh problem i metodov ikh resheniya estestvennym obrazom prikhodit ponimanie togo, chto nas okruzhayut stroki dannykh, kombinatornye skhemy. Ikh priroda dostatochno universal"na. Kniga "Nezavisimaya baziruemost" mnogoobraziy" yavlyaetsya tret"ey v serii. Osnovnoe vnimanie v knige udeleno voprosam, svyazannym s nezavisimoy baziruemost"yu mnogoobraziy algebraicheskikh sistem. V chastnosti, v knige rassmatrivaetsya problema raspoznavaniya nezavisimoy baziruemosti dlya mnogoobraziy vsekh polugrupp, monoidov i kolets.