Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity

Author： Grigoriev D.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.259, Iss.1, 2001-05, pp. : 613-622

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

Proofs as computations in linear logic

By Delzanno G.   Martelli M.  

Theoretical Computer Science, Vol. 258, Iss. 1, 2001-05 ,pp. : 269-297

Elsevier

Access to resources Recommend Favorite

A classical linear -calculus

By Bierman G.M.  

Theoretical Computer Science, Vol. 227, Iss. 1, 1999-09 ,pp. : 43-78

Elsevier

Access to resources Recommend Favorite

Lower bound for scalable Byzantine Agreement

By Holtby Dan  

Distributed Computing, Vol. 21, Iss. 4, 2008-10 ,pp. : 239-248

Springer Publishing Company

Access to resources Recommend Favorite

On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method

By Kolpakov R.   Posypkin M.   Sigal I.  

Automation and Remote Control, Vol. 71, Iss. 10, 2010-10 ,pp. : 2152-2161

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Linear-Time Self-Interpretation of the Pure Lambda Calculus

By Mogensen T.Æ.  

LISP and Symbolic Computation, Vol. 13, Iss. 3, 2000-09 ,pp. : 217-237

Springer Publishing Company

Access to resources Recommend Favorite