"The resolution complexity of random graph k-colorability."

Paul Beame et al. (2005)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2005.05.004

access: open

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/BeameCMM05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/BeameCMM05
Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore:
The resolution complexity of random graph k-colorability. Discret. Appl. Math. 153(1-3): 25-47 (2005)

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.