izpis_h1_title_alt

Polinomska prostorska zahtevnost : delo diplomskega seminarja
ID Osojnik, Aljaž (Author), ID Petkovšek, Marko (Mentor) More about this mentor... This link opens in a new window

.pdfPDF - Presentation file, Download (392,31 KB)
MD5: EDEA8B3205F7BA487371EAECAA164060
PID: 20.500.12556/rul/a255a880-3c27-4ed8-b431-e5c9c78b61cd

Language:Slovenian
Keywords:prostorska zahtevnost algoritmov, PSPACE-polni problemi, zahtevnostni razredi
Work type:Final seminar paper
Typology:2.11 - Undergraduate Thesis
Organization:FMF - Faculty of Mathematics and Physics
Place of publishing:Ljubljana
Publisher:[A. Osojnik]
Year:2011
Number of pages:25 str.
PID:20.500.12556/RUL-95838 This link opens in a new window
UDC:004
COBISS.SI-ID:16377945 This link opens in a new window
Publication date in RUL:19.10.2017
Views:1236
Downloads:477
Metadata:XML DC-XML DC-RDF
:
Copy citation
Share:Bookmark and Share

Secondary language

Language:English
Title:Polynomial space complexity
Keywords:space complexity of algorithms, PSPACE-complete problems, complexity classes, TQBF

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Back