Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,922,556 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Convex hull
Convolution
Ehrhart polynomial
Polynomial
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
NEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of o(loglogn) Depth
Fengming Wang
Theory and Applications of Models of Computation
2011
Corpus ID: 18123308
ACCm circuits are circuits consisting of unbounded fan-in AND, OR and MODm gates and unary NOT gates, where m is a fixed integer…
Expand
2011
2011
Disjoint-Path Facility Location: Theory and Practice
L. Breslau
,
Ilias Diakonikolas
,
+6 authors
S. Sen
Workshop on Algorithm Engineering and…
2011
Corpus ID: 309247
This paper is a theoretical and experimental study of two related facility location problems that emanated from networking…
Expand
2011
2011
On the Complexity of the Decisive Problem in Simple and Weighted Games
Fabián Riquelme
,
A. Polyméris
Electron. Notes Discret. Math.
2011
Corpus ID: 26626771
2011
2011
The Nyquist criterion for LTI time-delay systems
L. Pekař
,
R. Matušů
,
Petr Dostálek
,
Jan Dolinay
2011
Corpus ID: 11158747
This paper extends results about stability and stabilization of a retarded quasipolynomial obtained using the Mikhaylov criterion…
Expand
2010
2010
Stability Analysis of Time Delayed System with Coefficient Uncertainty and Time Delay Uncertainty
Da Zheng
,
Zhengyun Ren
,
Jian-An Fang
European Journal of Control
2010
Corpus ID: 207607594
A general class of linear time invariant (LTI) systems with uncertain coefficient and time delay is studied. This study proposes…
Expand
2010
2010
The Degree of a q-Holonomic Sequence is a Quadratic Quasi-Polynomial
S. Garoufalidis
Electronic Journal of Combinatorics
2010
Corpus ID: 27866583
A sequence of rational functions in a variable $q$ is $q$-holonomic if it satisfies a linear recursion with coefficients…
Expand
2004
2004
Approximation algorithms for finding low‐degree subgraphs
P. Klein
,
R. Krishnan
,
B. Raghavachari
,
R. Ravi
Networks
2004
Corpus ID: 9097133
We give quasipolynomial‐time approximation algorithms for designing networks with a minimum degree. Using our methods, one can…
Expand
1996
1996
A Complex Analog of Rolle Theorem and Polynomial Envelopes of Irreducible Differential Equations in the Complex Domain
S. YakovenkoThe
1996
Corpus ID: 17593974
We prove a complex analytic analog of the classical Rolle theorem asserting that the number of zeros of a real smooth function…
Expand
1995
1995
Frequency domain criterion for robust stability of interval time-delay systems
J. Kogan
,
A. Leizarowitz
at - Automatisierungstechnik
1995
Corpus ID: 5183611
1989
1989
The edge theorem and graphical tests for robust stability of neutral time-delay systems
M. Fu
,
A. Olbrot
,
M. Polis
at - Automatisierungstechnik
1989
Corpus ID: 12129257
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE