The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “A Quasi-Polynomial Algorithm for the Knapsack Problem”

All Tight Descriptions of 3-Stars in 3-Polytopes with Girth 5

Oleg V. Borodin, Anna O. Ivanova (2017)

Discussiones Mathematicae Graph Theory

Similarity:

Lebesgue (1940) proved that every 3-polytope P5 of girth 5 has a path of three vertices of degree 3. Madaras (2004) refined this by showing that every P5 has a 3-vertex with two 3-neighbors and the third neighbor of degree at most 4. This description of 3-stars in P5s is tight in the sense that no its parameter can be strengthened due to the dodecahedron combined with the existence of a P5 in which every 3-vertex has a 4-neighbor. We give another tight description of 3-stars in P5s:...

Approximations of the partial derivatives by averaging

Josef Dalík (2012)

Open Mathematics

Similarity:

A straightforward generalization of a classical method of averaging is presented and its essential characteristics are discussed. The method constructs high-order approximations of the l-th partial derivatives of smooth functions u in inner vertices a of conformal simplicial triangulations T of bounded polytopic domains in ℝd for arbitrary d ≥ 2. For any k ≥ l ≥ 1, it uses the interpolants of u in the polynomial Lagrange finite element spaces of degree k on the simplices with vertex...