No Cover Image

Book chapter 717 views

Worst-case Analysis, 3-SAT Decision and Lower Bounds: Approaches for Improved SAT Algorithms

Oliver Kullmann Orcid Logo

Satisfiability Problem: Theory and Applications (DIMACS Workshop March 11-13, 1996), Volume: 35, Pages: 261 - 313

Swansea University Author: Oliver Kullmann Orcid Logo

Abstract

The precursor of the TCS 1999 article.

Published in: Satisfiability Problem: Theory and Applications (DIMACS Workshop March 11-13, 1996)
Published: American Mathematical Society 1997
URI: https://cronfa.swan.ac.uk/Record/cronfa19385
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2014-11-21T02:56:08Z
last_indexed 2018-02-09T04:54:53Z
id cronfa19385
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2014-11-20T14:06:44.0785875</datestamp><bib-version>v2</bib-version><id>19385</id><entry>2014-11-20</entry><title>Worst-case Analysis, 3-SAT Decision and Lower Bounds: Approaches for Improved SAT Algorithms</title><swanseaauthors><author><sid>2b410f26f9324d6b06c2b98f67362d05</sid><ORCID>0000-0003-3021-0095</ORCID><firstname>Oliver</firstname><surname>Kullmann</surname><name>Oliver Kullmann</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2014-11-20</date><deptcode>SCS</deptcode><abstract>The precursor of the TCS 1999 article.</abstract><type>Book chapter</type><journal>Satisfiability Problem: Theory and Applications (DIMACS Workshop March 11-13, 1996)</journal><volume>35</volume><paginationStart>261</paginationStart><paginationEnd>313</paginationEnd><publisher>American Mathematical Society</publisher><keywords>SAT, algorithms, worst-case upper bounds</keywords><publishedDay>31</publishedDay><publishedMonth>12</publishedMonth><publishedYear>1997</publishedYear><publishedDate>1997-12-31</publishedDate><doi/><url/><notes></notes><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2014-11-20T14:06:44.0785875</lastEdited><Created>2014-11-20T14:05:45.8434142</Created><path><level id="1">College of Science</level><level id="2">Computer Science</level></path><authors><author><firstname>Oliver</firstname><surname>Kullmann</surname><orcid>0000-0003-3021-0095</orcid><order>1</order></author></authors><documents/><OutputDurs/></rfc1807>
spelling 2014-11-20T14:06:44.0785875 v2 19385 2014-11-20 Worst-case Analysis, 3-SAT Decision and Lower Bounds: Approaches for Improved SAT Algorithms 2b410f26f9324d6b06c2b98f67362d05 0000-0003-3021-0095 Oliver Kullmann Oliver Kullmann true false 2014-11-20 SCS The precursor of the TCS 1999 article. Book chapter Satisfiability Problem: Theory and Applications (DIMACS Workshop March 11-13, 1996) 35 261 313 American Mathematical Society SAT, algorithms, worst-case upper bounds 31 12 1997 1997-12-31 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2014-11-20T14:06:44.0785875 2014-11-20T14:05:45.8434142 College of Science Computer Science Oliver Kullmann 0000-0003-3021-0095 1
title Worst-case Analysis, 3-SAT Decision and Lower Bounds: Approaches for Improved SAT Algorithms
spellingShingle Worst-case Analysis, 3-SAT Decision and Lower Bounds: Approaches for Improved SAT Algorithms
Oliver Kullmann
title_short Worst-case Analysis, 3-SAT Decision and Lower Bounds: Approaches for Improved SAT Algorithms
title_full Worst-case Analysis, 3-SAT Decision and Lower Bounds: Approaches for Improved SAT Algorithms
title_fullStr Worst-case Analysis, 3-SAT Decision and Lower Bounds: Approaches for Improved SAT Algorithms
title_full_unstemmed Worst-case Analysis, 3-SAT Decision and Lower Bounds: Approaches for Improved SAT Algorithms
title_sort Worst-case Analysis, 3-SAT Decision and Lower Bounds: Approaches for Improved SAT Algorithms
author_id_str_mv 2b410f26f9324d6b06c2b98f67362d05
author_id_fullname_str_mv 2b410f26f9324d6b06c2b98f67362d05_***_Oliver Kullmann
author Oliver Kullmann
author2 Oliver Kullmann
format Book chapter
container_title Satisfiability Problem: Theory and Applications (DIMACS Workshop March 11-13, 1996)
container_volume 35
container_start_page 261
publishDate 1997
institution Swansea University
publisher American Mathematical Society
college_str College of Science
hierarchytype
hierarchy_top_id collegeofscience
hierarchy_top_title College of Science
hierarchy_parent_id collegeofscience
hierarchy_parent_title College of Science
department_str Computer Science{{{_:::_}}}College of Science{{{_:::_}}}Computer Science
document_store_str 0
active_str 0
description The precursor of the TCS 1999 article.
published_date 1997-12-31T03:29:31Z
_version_ 1737025043603390464
score 10.88812