The complexity of propositional implication

Beyersdorff, O, Meier, A, Thomas, M and Vollmer, H (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
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 07 Aug 2012 12:40
Last Modified: 16 Sep 2016 14:18
Published Version: http://dx.doi.org/10.1016/j.ipl.2009.06.015
Status: Published
Publisher: Elsevier
Identification Number: 10.1016/j.ipl.2009.06.015

Share / Export

Statistics