Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Eleni Bakali"'
Publikováno v:
ACM SIGACT News. 53:46-68
Since Valiant's seminal work, where the complexity class #P was defined, much research has been done on counting complexity, from various perspectives. A question that permeates many of these efforts concerns the approximability of counting problems,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::67c6926c61f37b5fc511d2dad393d9a6
https://doi.org/10.1145/3561064.3561072
https://doi.org/10.1145/3561064.3561072
Autor:
Antonis Antonopoulos, Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos
Publikováno v:
Theoretical Computer Science. 915:55-73
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02b842cf3d7ce4f7bf625709bc0454b3
https://doi.org/10.1016/j.tcs.2022.02.030
https://doi.org/10.1016/j.tcs.2022.02.030
Autor:
Eleni Bakali, Merkouris Karaliopoulos
Publikováno v:
IEEE Transactions on Mobile Computing. 21:1305-1318
In this paper, we revisit the well-investigated question of how to optimize the contributions of mobile end users to MCS tasks. However, we depart from the bulk of related literature by explicitly accounting for the bounded rationality evidenced in h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef9d9234813cba0165b0be317cd87401
https://doi.org/10.1109/tmc.2020.3023757
https://doi.org/10.1109/tmc.2020.3023757
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030592660
TAMC
TAMC
An important objective of research in counting complexity is to understand which counting problems are approximable. In this quest, the complexity class \(\mathsf {TotP}\), a hard subclass of \(\#\mathsf {P}\), is of key importance, as it contains se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2cfc76b994b6b9a82ccbc0cce47aec80
https://doi.org/10.1007/978-3-030-59267-7_22
https://doi.org/10.1007/978-3-030-59267-7_22
Autor:
Martin Fürer, Panagiotis Cheilaris, Christos Nomikos, Euripides Markou, Nikolaos Papaspyrou, Eleni Bakali, Dimitris Fotakis, Katerina Potika, Costas D. Koutras, Christos H. Papadimitriou, Aris Pagourtzis
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319575858
CIAC
CIAC
This year we are celebrating the 70th birthday of Stathis! We take this chance to recall some of his remarkable contributions to Computer Science.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1afd97f73302facf4c5e8084a468de72
https://doi.org/10.1007/978-3-319-57586-5_39
https://doi.org/10.1007/978-3-319-57586-5_39
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319575858
CIAC
CIAC
Counting problems with easy decision are the only ones among problems in complexity class \(\#\textsc {P}\) that are likely to be (randomly) approximable, under the assumption \(\textsc {RP}\ne \textsc {NP}\). \(\text {TotP} \) is a subclass of \(\#\
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb1075c0612fa9ba2a8976804bc9ec2b
https://doi.org/10.1007/978-3-319-57586-5_6
https://doi.org/10.1007/978-3-319-57586-5_6