Výsledky vyhledávání - "parameterized computational problem"

Computation Models for Parameterized Complexity: Computation models for parameterized complexity

Autoři: Cesati M. Di Ianni M. Cesati, M a další

Přispěvatelé: Cesati M. Di Ianni M. Cesati, M a další

Zdroj: Mathematical Logic Quarterly. 43:179-202

Témata: Analysis of algorithms and problem complexity, Settore ING-INF/05 - SISTEMI DI ELABORAZIONE DELLE INFORMAZIONI, Turing machines, 0102 computer and information sciences, Models of computation (Turing machines, etc.), parameterized computational problem, 01 natural sciences, Computational complexity, Turing machine, Turing machines and related notions, Complexity classes (hierarchies, relations among complexity classes, etc.), 0101 mathematics, Parameterized computational complexity

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: https://art.torvergata.it/bitstream/2108/260205/1/malq.19970430204.pdf
https://dblp.uni-trier.de/db/journals/mlq/mlq43.html#CesatiI97
https://philpapers.org/rec/CESCMF