An Upper Bound on the Space Complexity of Random Formulae in Resolution

E-ISSN： 1290-385x|36|4|329-339

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.36, Iss.4, 2010-03, pp. : 329-339

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

An upper bound on the complexity of recognizable tree languages

By Finkel Olivier Lecomte Dominique Simonnet Pierre

RAIRO - Theoretical Informatics and Applications, Vol. 49, Iss. 2, 2015-07 ,pp. : 121-137

Edp Sciences

Access to resources Recommend Favorite

Advice Complexity and Barely Random Algorithms

By Komm Dennis Královič Richard

RAIRO - Theoretical Informatics and Applications, Vol. 45, Iss. 2, 2011-06 ,pp. : 249-267

Edp Sciences

Access to resources Recommend Favorite

Time and space complexity of reversible pebbling

By Královič Richard

RAIRO - Theoretical Informatics and Applications, Vol. 38, Iss. 2, 2010-03 ,pp. : 137-161

Edp Sciences

Access to resources Recommend Favorite

The upper bound of step size for FDPANC algorithm with nonlinear secondary path

By Wu Ming Yang Jun

INTER-NOISE and NOISE-CON Congress and Conference Proceedings, Vol. 2012, Iss. 8, 2012-08 ,pp. : 3102-3112

Institute of Noise Control Engineering

Access to resources Recommend Favorite

An upper bound for transforming self-verifying automata into deterministic ones

By Assent Ira Seibert Sebastian

RAIRO - Theoretical Informatics and Applications, Vol. 41, Iss. 3, 2007-09 ,pp. : 261-265

Edp Sciences

Access to resources Recommend Favorite