An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams

Publisher： Cambridge University Press

E-ISSN： 1943-5886|73|1|227-237

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.73, Iss.1, 2008-03, pp. : 227-237

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Construction of an NP Problem with an Exponential Lower Bound

By  

International Journal of Mathematics, Game Theory and Algebra, Vol. , Iss. , 2014-07 ,pp. : 27-38

Nova Science Publishers, Inc.

Access to resources Recommend Favorite

A New Lower Bound on the Minimal Length of a Binary Linear Code

By Bhandari M.C.   Garg M.S.  

European Journal of Combinatorics, Vol. 17, Iss. 4, 1996-05 ,pp. : 335-342

Academic Press

Access to resources Recommend Favorite

Discretely ordered modules as a first-order extension of the cutting planes proof system

By  

The Journal of Symbolic Logic, Vol. 63, Iss. 4, 1998-12 ,pp. : 1582-1596

Cambridge University Press

Access to resources Recommend Favorite

A Lower Bound on Blocking Semiovals

By Dover J.M.  

European Journal of Combinatorics, Vol. 21, Iss. 5, 2000-07 ,pp. : 571-577

Elsevier

Access to resources Recommend Favorite

The Zig-Zag Property and Exponential Cancellation of Ordered Sets

By McKenzie Ralph  

Order, Vol. 20, Iss. 3, 2003-01 ,pp. : 185-221

Springer Publishing Company

Access to resources Recommend Favorite