"Clause Shortening Combined with Pruning Yields a New Upper Bound for ..."

Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert (2006)

> Home

Details and statistics

DOI: 10.1007/11758471_9

access: closed

type: Conference or Workshop Paper

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ciac/DantsinHW06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ciac/DantsinHW06
Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert:
Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. CIAC 2006: 60-68

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.