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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1987-2018
020406019872018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Parity games play an important role in model checking and synthesis. In their paper, Calude et al. have recently shown that these… (More)
  • figure 1
  • table 1
  • figure 2
Is this relevant?
2014
2014
We describe how to approximate, in quasi-polynomial time, the largest independent set of polygons, in a given set of polygons… (More)
  • figure 2.1
Is this relevant?
2013
2013
We call a depth-4 formula C <i>set-depth-4</i> if there exists a (unknown) partition X<sub>1</sub>⊔⋅⋅⋅⊔ X<sub>d</sub> of the… (More)
Is this relevant?
2011
2011
Tractability of multivariate problems has become nowadays a popular research subject. Polynomial tractability means that the… (More)
Is this relevant?
2011
2011
In this paper, we present and prove the first closed formula bounding the degree of regularity of an HFE system over an arbitrary… (More)
  • table 1
Is this relevant?
2009
2009
In [6] the authors introduced the notion of quasi-polynomial function as being a mapping f : Xn → X defined and valued on a… (More)
Is this relevant?
2006
2006
We present a polynomial time algorithm to compute any fixed number of the highest coefficients of the Ehrhart quasi-polynomial of… (More)
Is this relevant?
2006
2006
The MINIMUM WEIGHT TRIANGULATION problem is to find a triangulation T* of minimum length for a given set of points P in the… (More)
  • figure 3.1
  • figure 3.2
  • figure 3.3
  • figure 5.1
  • figure 5.2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We propose a relaxation of zero-knowledge, by allowing the simulator to run in quasi-polynomial time. We show that protocols… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Given a planar graph on n nodes with costs (weights) on its edges, de ne the distance between nodes i and j as the length of the… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?