No Cover Image

Journal article 569 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.

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

Tags: Add Tag
No Tags, Be the first to tag this record!
College: College of Science
Issue: 1
Start Page: 503