Výsledky vyhledávání - "parameterised complexity theory"
-
1
Autoři: a další
Přispěvatelé: a další
Zdroj: SIAM Journal on Computing. 53:1409-1438
Témata: 0301 basic medicine, FOS: Computer and information sciences, parameterised complexity theory, counting problems, Discrete Mathematics (cs.DM), 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, somewhere dense graphs, Computer Science - Computational Complexity, 03 medical and health sciences, parameterized complexity theory, ddc:004, Computer Science - Discrete Mathematics
Popis souboru: application/pdf
Přístupová URL adresa: http://arxiv.org/abs/2209.03402
https://ora.ox.ac.uk/objects/uuid:ec3d7a28-7134-415f-8d64-4aa422b7edaf
https://doi.org/10.1137/22m1535668
https://drops.dagstuhl.de/opus/volltexte/2023/17530/pdf/LIPIcs-ITCS-2023-27.pdf
https://hdl.handle.net/2434/961285
https://doi.org/10.4230/lipics.itcs.2023.27
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.27 -
2
Autoři: a další
Přispěvatelé: a další
Témata: counting problem, parameterised complexity theory, somewhere dense graphs, Settore INF/01 - Informatica
Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-263-1; info:eu-repo/semantics/altIdentifier/wos/WOS:001532714400027; ispartofbook:14th Innovations in Theoretical Computer Science Conference (ITCS 2023); Innovations in Theoretical Computer Science Conference (ITCS); volume:251; firstpage:27: 1; lastpage:27: 14; numberofpages:14; serie:LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS; alleditors:Y.T. Kalai; https://hdl.handle.net/2434/961285
-
3
Nájsť tento článok vo Web of Science