"Counting solutions to CSP using generating polynomials."

Daniel Berend, Shahar Golan (2014)

> Home

Details and statistics

DOI: 10.1016/J.JDA.2014.01.004

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jda/BerendG14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/BerendG14
Daniel Berend, Shahar Golan:
Counting solutions to CSP using generating polynomials. J. Discrete Algorithms 26: 89-97 (2014)

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.