adiunkt
* Faculty of Electrical Engineering, Automatics, Computer Science and Electronics WEAIiE-ki
ORCID: brak
ResearcherID: brak
Scopus: brak
Properties of uniformly hard languages / Piotr Faliszewski, Janusz JAROSZ // Information Processing Letters ; ISSN 0020-0190. — 2005 vol. 95 iss. 1, s. 329–332. — Bibliogr. s. 332, Abstr.. — P. Faliszewski – afiliacja: Department of Computer Science, University of Rochester, Rochester, USA. — tekst: https://www-1sciencedirect-1com-1000003ga0740.wbg2.bg.agh.edu.pl/science/article/pii/S0020019005000761/pdf?md5=ed70ecb46648bc04caad7fb4ab34072e&pid=1-s2.0-S0020019005000761-main.pdf
keywords: computational complexity, uniform hardness, time hierarchy, polynomial hierarchy
cyfrowy identyfikator dokumentu: 10.1016/j.ipl.2004.11.014