Hilbert Function and Complexity Lower Bounds for Symmetric Boolean Functions

ISSN： 0890-5401

Source： Information and Computation, Vol.153, Iss.1, 1999-08, pp. : 1-25

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

Lower Bounds for the Complexity of Functions in a Realistic RAM Model

By Bshouty N.H.

Journal of Algorithms, Vol. 32, Iss. 1, 1999-07 ,pp. : 1-20

Academic Press

Access to resources Recommend Favorite

Propositional lower bounds: Algorithms and complexity

By Cadoli M.

Annals of Mathematics and Artificial Intelligence, Vol. 27, Iss. 1-4, 1999-01 ,pp. : 129-148

Springer Publishing Company

Access to resources Recommend Favorite

Permutation equivalence of cubic rotation symmetric Boolean functions

By Cusick Thomas W.

International Journal of Computer Mathematics, Vol. 92, Iss. 8, 2015-08 ,pp. : 1568-1573

Taylor & Francis Ltd

Access to resources Recommend Favorite

Lower bounds for algebraic complexity of nilpotent associative algebras

By Leont’ev A.

Journal of Mathematical Sciences, Vol. 169, Iss. 5, 2010-09 ,pp. : 644-650

Springer Publishing Company

Access to resources Recommend Favorite

Integration of Primal Lower Nice Functions in Hilbert Spaces

By Bernard F. Thibault L. Zagrodny D.

Journal of Optimization Theory and Applications, Vol. 124, Iss. 3, 2005-03 ,pp. : 561-579

Springer Publishing Company

Access to resources Recommend Favorite