Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A sharp threshold in proof complexity yields lower bounds for ..."

Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy (2004)

> Home

Details and statistics

DOI: 10.1016/J.JCSS.2003.07.011

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jcss/AchlioptasBM04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/AchlioptasBM04
Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy:
A sharp threshold in proof complexity yields lower bounds for satisfiability search. J. Comput. Syst. Sci. 68(2): 238-268 (2004)

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.