Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Typical case complexity of Satisfiability Algorithms and the threshold ..."

John V. Franco (2005)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2005.05.008

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/Franco05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Franco05
John V. Franco:
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon. Discret. Appl. Math. 153(1-3): 89-123 (2005)

a service of

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.