## What is/are Strict Polynomial?

Strict Polynomial - We consider the problem of designing and analyzing differentially private algorithms that can be implemented on discrete models of computation in strict polynomial time, motivated by known attacks on floating point implementations of real-arithmetic differentially private algorithms (Mironov, CCS 2012) and the potential for timing attacks on expected polynomial-time algorithms.^{[1]}Consider a finite system of non-strict polynomial inequalities with solution set $$S\subseteq \mathbb R^n$$S⊆Rn.

^{[2]}On the other hand, the planarity of the model allows us to use a strict polynomial algorithm to find its partition function and other characteristics.

^{[3]}We introduce the notion of strict polynomial separation and show that the strict polynomial separation of two sets can be also reduced to the solution of a linear programming problem.

^{[4]}