Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials

ISSN： 1432-4350

Source： Theory of Computing Systems, Vol.49, Iss.2, 2011-08, pp. : 343-354

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

Upper and Lower Bounds for Kazhdan-Lusztig Polynomials

By Brenti F.

European Journal of Combinatorics, Vol. 19, Iss. 3, 1998-04 ,pp. : 283-297

Elsevier

Access to resources Recommend Favorite

Lower bounds for the merit factors of trigonometric polynomials from Littlewood classes

By Borwein P. Erdelyi T.

Journal of Approximation Theory, Vol. 125, Iss. 2, 2003-12 ,pp. : 190-197

Elsevier

Access to resources Recommend Favorite

Bounds on the degree of APN polynomials: the case of x ⁻¹ + g(x)

By Leander Gregor Rodier François

Designs, Codes and Cryptography, Vol. 59, Iss. 1-3, 2011-04 ,pp. : 207-222

Springer Publishing Company

Access to resources Recommend Favorite

Explicit formulae for Kerov polynomials

By Petrullo P. Senato D.

Journal of Algebraic Combinatorics, Vol. 33, Iss. 1, 2011-02 ,pp. : 141-151

Springer Publishing Company

Access to resources Recommend Favorite

Complexity bounds on proofs

The Journal of Symbolic Logic, Vol. 46, Iss. 2, 1981-06 ,pp. : 255-258

Cambridge University Press

Access to resources Recommend Favorite