Skip to search formSkip to main contentSkip to account menu

Quasi-polynomial

Known as: Quasi polynomial, Quasipolynomial 
In mathematics, a quasi-polynomial (pseudo-polynomial) is a generalization of polynomials. While the coefficients of a polynomial come from a ring… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
ACCm circuits are circuits consisting of unbounded fan-in AND, OR and MODm gates and unary NOT gates, where m is a fixed integer… 
2011
2011
This paper is a theoretical and experimental study of two related facility location problems that emanated from networking… 
2011
2011
This paper extends results about stability and stabilization of a retarded quasipolynomial obtained using the Mikhaylov criterion… 
2010
2010
A general class of linear time invariant (LTI) systems with uncertain coefficient and time delay is studied. This study proposes… 
2010
2010
A sequence of rational functions in a variable $q$ is $q$-holonomic if it satisfies a linear recursion with coefficients… 
2004
2004
We give quasipolynomial‐time approximation algorithms for designing networks with a minimum degree. Using our methods, one can… 
1996
1996
We prove a complex analytic analog of the classical Rolle theorem asserting that the number of zeros of a real smooth function…