"Analyzing the impact of bounded degree constraints on computational ..."

Mohammed Elaroussi (2025)

> Home

Details and statistics

DOI: 10.1177/19462174241306715

access: closed

type: Journal Article

metadata version: 2025-07-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/argcom/Elaroussi25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/argcom/Elaroussi25
Mohammed Elaroussi:
Analyzing the impact of bounded degree constraints on computational complexity of argumentation frameworks. Argument Comput. 16(1): 108-129 (2025)

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.