"Completeness, approximability and exponential time results for counting ..."

Antonis Antonopoulos et al. (2022)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2022.02.030

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/AntonopoulosBCP22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/AntonopoulosBCP22
Antonis Antonopoulos, Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos:
Completeness, approximability and exponential time results for counting problems with easy decision version. Theor. Comput. Sci. 915: 55-73 (2022)

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.