Polinomska prostorska zahtevnost
delo diplomskega seminarja
Abstract
Polinomska prostorska zahtevnost
Keywords
prostorska zahtevnost algoritmov;PSPACE-polni problemi;zahtevnostni razredi;
Data
| Language: | Slovenian |
|---|---|
| Year of publishing: | 2011 |
| Source: | Ljubljana |
| Typology: | 2.11 - Undergraduate Thesis |
| Organization: | UL FMF - Faculty of Mathematics and Physics |
| Publisher: | [A. Osojnik] |
| UDC: | 004 |
| COBISS: |
16377945
|
| Views: | 597 |
| Downloads: | 438 |
| Average score: | 0 (0 votes) |
| Metadata: |
|
Other data
| Secondary language: | English |
|---|---|
| Secondary title: | Polynomial space complexity |
| Secondary keywords: | space complexity of algorithms;PSPACE-complete problems;complexity classes;TQBF; |
| Type (COBISS): | Final seminar paper |
| Thesis comment: | Univ. v Ljubljani, Fak. za matematiko in fiziko, Oddelek za matematiko, Matematika - 1. stopnja |
| Pages: | 25 str. |
| ID: | 10910499 |
Recommended works:
Polinomska prostorska zahtevnost
2011,
delo diplomskega seminarja
Ukkonenov algoritem konstrukcije priponskega drevesa
2020,
diplomsko delo
Algoritem Burrows-Wheelerjeve transformacije
2016,
diplomsko delo
Prostorska zahtevnost grafovskih dominacijskih iger
2021,
diplomsko delo
Iskanje niza v besedilu
2012,
diplomsko delo