Cubic and higher degree bounds for codes and ( t , m , s )-nets

By Trinker Horst  

Designs, Codes and Cryptography, Vol. 60, Iss. 2, 2011-08 ,pp. : 101-121

Springer Publishing Company

Access to resources Recommend Favorite

A 1-generic degree which bounds a minimal degree

By  

The Journal of Symbolic Logic, Vol. 55, Iss. 2, 1990-06 ,pp. : 733-743

Cambridge University Press

Access to resources Recommend Favorite

Degree bounds for type-A weight rings and Gelfand–Tsetlin semigroups

By Howard Benjamin   McAllister Tyrrell  

Journal of Algebraic Combinatorics, Vol. 34, Iss. 2, 2011-09 ,pp. : 237-249

Springer Publishing Company

Access to resources Recommend Favorite

Toric Initial Ideals of ∆-Normal Configurations: Cohen-Macaulayness and Degree Bounds

By O’Shea Edwin   Thomas Rekha  

Journal of Algebraic Combinatorics, Vol. 21, Iss. 3, 2005-05 ,pp. : 247-268

Springer Publishing Company

Access to resources Recommend Favorite

Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials

By Jansen Maurice  

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

Springer Publishing Company

Access to resources Recommend Favorite