✦ LIBER ✦

The Complexity of the Extendibility Problem for Finite Posets

✍ Scribed by Larose, Benoit; Zádori, László

Book ID: 118198873
Publisher: Society for Industrial and Applied Mathematics
Year: 2003
Tongue: English
Weight: 119 KB
Volume: 17
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480101389478

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Complexity of Computing Winning S

On the Complexity of Computing Winning Strategies for Finite Poset Games

✍ Michael Soltys; Craig Wilson 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 480 KB

Complexity of the identity checking prob

Complexity of the identity checking problem for finite semigroups

✍ J. Almeida; M. V. Volkov; S. V. Goldberg 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 230 KB

Greedy posets for the bump-minimizing pr

Greedy posets for the bump-minimizing problem

✍ Nejib Zaguia 📂 Article 📅 1987 🏛 Springer Netherlands 🌐 English ⚖ 678 KB

Continuous Extendibility of Solutions of

Continuous Extendibility of Solutions of the Neumann Problem for the Laplace Equation

✍ Dagmar Medková 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 192 KB

Continuous Extendibility of Solutions of

Continuous Extendibility of Solutions of the Third Problem for the Laplace Equation

✍ Dagmar Medková 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 214 KB

The extended finite element method (XFEM

The extended finite element method (XFEM) for solidification problems

✍ Jack Chessa; Patrick Smolinski; Ted Belytschko 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 340 KB 👁 1 views

## Abstract An enriched finite element method for the multi‐dimensional Stefan problems is presented. In this method the standard finite element basis is enriched with a discontinuity in the derivative of the temperature normal to the interface. The approximation can then represent the phase interf