
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
  <dc:title xml:lang="srp">Пермутације са ограничењима : докторска дисертација / Владимир М. Балтић. </dc:title>
  <dc:format>PDF/A (131 list)</dc:format>
  <dc:format>1386477 bytes</dc:format>
  <dc:language>srp</dc:language>
  <dc:date>2014</dc:date>
  <dc:contributor>Stevanović, Dragan, 1974-</dc:contributor>
  <dc:contributor>Ilić, Snežana, 1954-</dc:contributor>
  <dc:contributor>Simić, Slobodan, 1948-</dc:contributor>
  <dc:contributor>Petrović, Vojislav, 1951-</dc:contributor>
  <dc:contributor>Dobroslovački, Rade</dc:contributor>
  <dc:description xml:lang="eng">In this thesis we study different methods of counting a large number of
combinatorial objects: permutations, variations, combinations, subsets, with
some additional restrictions. We have developed a completely new method
for the enumeration of some of these objects and make connections among
some of them. We estimate the algorithmic complexity of the new method
and analyze what is better than existing ones. We have entered a hundred
new sequences in Slone’s Online encyclopedia of integer sequences and
provided comments on the large number of existing sequences.</dc:description>
  <dc:description xml:lang="srp">Ћир.На полеђини насл. листа: Restricted permutations. Биографија аутора: лист 120.Умножено за одбрану. Универзитет у Нишу, Природно-математички факултет, Департман за математику, 2014. Извод ; Abstract. Библиографија: листа 121-122.</dc:description>
  <dc:type>info:eu-repo/semantics/bachelorThesis</dc:type>
  <dc:rights>http://creativecommons.org/licenses/by-nc-sa/2.0/at/legalcode</dc:rights>
  <dc:creator>Baltić, Vladimir M., 1973-</dc:creator>
  <dc:identifier>https://phaidrani.ni.ac.rs/o:880</dc:identifier>
  <dc:identifier>cobiss:1024755433</dc:identifier>
  <dc:identifier>thesis:1340</dc:identifier>
</oai_dc:dc>