BibTeX record journals/tcs/AntonopoulosBCP22

download as .bib file

@article{DBLP:journals/tcs/AntonopoulosBCP22,
  author       = {Antonis Antonopoulos and
                  Eleni Bakali and
                  Aggeliki Chalki and
                  Aris Pagourtzis and
                  Petros Pantavos and
                  Stathis Zachos},
  title        = {Completeness, approximability and exponential time results for counting
                  problems with easy decision version},
  journal      = {Theor. Comput. Sci.},
  volume       = {915},
  pages        = {55--73},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.tcs.2022.02.030},
  doi          = {10.1016/J.TCS.2022.02.030},
  timestamp    = {Sat, 30 Sep 2023 10:28:04 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/AntonopoulosBCP22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.