The complexity of propositional implication

Beyersdorff, O, Meier, A, Thomas, M et al. (1 more author) (2009) The complexity of propositional implication. Information Processing Letters, 109 (18). 1071 - 1077 . ISSN 0020-0190

Abstract

Metadata

Authors/Creators:
  • Beyersdorff, O
  • Meier, A
  • Thomas, M
  • Vollmer, H
Keywords: Computational complexity, Propositional implication, Post's lattice
Dates:
  • Published: 31 August 2009
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 07 Aug 2012 12:40
Last Modified: 04 Nov 2016 02:10
Published Version: http://dx.doi.org/10.1016/j.ipl.2009.06.015
Status: Published
Publisher: Elsevier
Identification Number: https://doi.org/10.1016/j.ipl.2009.06.015

Download not available

A full text copy of this item is not currently available from White Rose Research Online

Export

Statistics