complexity of monomial evaluations and duality
From MaRDI portal
Complexity of monomial evaluations and duality
Recommendations
- On the complexity of computation of a pair of monomials in two variables
- The complexity of monotone computations of polynomials
- scientific article; zbMATH DE number 4045141
- On the complexity of computations on monomials and tuples of powers
- Relation between two measures of the computation complexity for systems of monomials
- On the complexity of calculating systems of monomials with restrictions on the powers of variables
- The complexity of testing monomials in multivariate polynomials
- Complexity of certain systems of monomials in calculation by composition circuits
- scientific article; zbMATH DE number 3960990
- Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm
Cited in
(6)- On the complexity of computations on monomials and tuples of powers
- Complexity of certain systems of monomials in calculation by composition circuits
- On the complexity of implementation of a system of two monomials by composition circuits
- Relation between two measures of the computation complexity for systems of monomials
- THE COMPLEXITY OF IMPLEMENTATION OF A SYSTEM OF MONOMIALS IN TWO VARIABLES BY COMPOSITION CIRCUITS
- On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
This page was built for publication: complexity of monomial evaluations and duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3156435)