"Complexity of Satisfiability Problems with Symmetric Polynomial Clauses."

Nadia Creignou, Malika More (1997)

> Home

Details and statistics

DOI: 10.1093/LOGCOM/7.3.353

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/logcom/CreignouM97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/logcom/CreignouM97
Nadia Creignou, Malika More:
Complexity of Satisfiability Problems with Symmetric Polynomial Clauses. J. Log. Comput. 7(3): 353-366 (1997)

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.