Number of the records: 1
Bounds on Complexity when Sorting Reals
SYS 0531334 LBL 01000a^^22220027750^450 005 20240103224300.3 014 $a 85087528484 $2 SCOPUS 017 $a 10.46300/9106.2020.14.39 $2 DOI 100 $a 20200731d m y slo 03 ba 101 $a eng 102 $a US 200 1-
$a Bounds on Complexity when Sorting Reals 215 $a 6 s. $c E 463 -1
$1 001 cav_un_epca*0531333 $1 011 $a 1998-4464 $1 200 1 $a International Journal of Circuits, Systems and Signal Processing $v Roč. 14, July (2020), s. 276-281 $1 210 $c North Atlantic University Union 610 $a Linear time 610 $a Sorting reals 610 $a Time complexity 700 -1
$3 cav_un_auth*0100769 $a Jiřina $b Marcel $p UIVT-O $i Oddělení strojového učení $j Department of Machine Learning $w Department of Machine Learning $T Ústav informatiky AV ČR, v. v. i. 856 $u http://hdl.handle.net/11104/0310011 $9 RIV
Number of the records: 1