No Cover Image

Journal article 1122 views

Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference

Herbert Fleischner, Oliver Kullmann Orcid Logo, Stefan Szeider

Theoretical Computer Science, Volume: 289, Issue: 1, Start page: 503

Swansea University Author: Oliver Kullmann Orcid Logo

Full text not available from this repository: check for access using links below.

Check full text

DOI (Published version): 10.1016/S0304-3975(01)00337-1

Published in: Theoretical Computer Science
ISSN: 0304-3975
Published: 2002
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa1716
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2013-07-23T11:48:11Z
last_indexed 2018-02-09T04:29:14Z
id cronfa1716
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2013-10-17T14:53:46.5195511</datestamp><bib-version>v2</bib-version><id>1716</id><entry>2011-10-01</entry><title>Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference</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>2011-10-01</date><deptcode>SCS</deptcode><abstract></abstract><type>Journal Article</type><journal>Theoretical Computer Science</journal><volume>289</volume><journalNumber>1</journalNumber><paginationStart>503</paginationStart><paginationEnd/><publisher/><placeOfPublication/><issnPrint>0304-3975</issnPrint><issnElectronic/><keywords/><publishedDay>31</publishedDay><publishedMonth>12</publishedMonth><publishedYear>2002</publishedYear><publishedDate>2002-12-31</publishedDate><doi>10.1016/S0304-3975(01)00337-1</doi><url/><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2013-10-17T14:53:46.5195511</lastEdited><Created>2011-10-01T00:00:00.0000000</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Herbert</firstname><surname>Fleischner</surname><order>1</order></author><author><firstname>Oliver</firstname><surname>Kullmann</surname><orcid>0000-0003-3021-0095</orcid><order>2</order></author><author><firstname>Stefan</firstname><surname>Szeider</surname><order>3</order></author></authors><documents/><OutputDurs/></rfc1807>
spelling 2013-10-17T14:53:46.5195511 v2 1716 2011-10-01 Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference 2b410f26f9324d6b06c2b98f67362d05 0000-0003-3021-0095 Oliver Kullmann Oliver Kullmann true false 2011-10-01 SCS Journal Article Theoretical Computer Science 289 1 503 0304-3975 31 12 2002 2002-12-31 10.1016/S0304-3975(01)00337-1 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2013-10-17T14:53:46.5195511 2011-10-01T00:00:00.0000000 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Herbert Fleischner 1 Oliver Kullmann 0000-0003-3021-0095 2 Stefan Szeider 3
title Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
spellingShingle Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
Oliver Kullmann
title_short Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
title_full Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
title_fullStr Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
title_full_unstemmed Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
title_sort Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
author_id_str_mv 2b410f26f9324d6b06c2b98f67362d05
author_id_fullname_str_mv 2b410f26f9324d6b06c2b98f67362d05_***_Oliver Kullmann
author Oliver Kullmann
author2 Herbert Fleischner
Oliver Kullmann
Stefan Szeider
format Journal article
container_title Theoretical Computer Science
container_volume 289
container_issue 1
container_start_page 503
publishDate 2002
institution Swansea University
issn 0304-3975
doi_str_mv 10.1016/S0304-3975(01)00337-1
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science
document_store_str 0
active_str 0
published_date 2002-12-31T03:04:32Z
_version_ 1763749577356214272
score 11.037144

Similar Items