✦ LIBER ✦

Concrete physics method for solving NP hard problem

✍ Scribed by Huang Wen-qi

Book ID: 105718510
Publisher: Wuhan University
Year: 2001
Tongue: English
Weight: 589 KB
Volume: 6
Category: Article
ISSN: 1007-1202
DOI: 10.1007/bf03160234

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving NP-hard problems in ‘almost tree

Solving NP-hard problems in ‘almost trees’: Vertex cover

✍ Don Coppersmith; Uzi Vishkin 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 842 KB

A Quasi-mechanical Method for Solving th

A Quasi-mechanical Method for Solving the Rectangle Covering Problem-An Approach to Tackling NP Hard Problems

✍ W.Q. Huang; G.Q. Wang 📂 Article 📅 1994 🏛 Elsevier Science ⚖ 284 KB

In some curved spaces, one can solve NP-

In some curved spaces, one can solve NP-hard problems in polynomial time

✍ V. Kreinovich; M. Margenstern 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 266 KB

Two NP-Hard Art-Gallery Problems for Ort

Two NP-Hard Art-Gallery Problems for Ortho-Polygons

✍ Dietmar Schuchardt; Hans-Dietrich Hecker 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 292 KB

## Abstract D. T. Lee and A. K. Lin [2] proved that VERTEX‐GUARDING and POINT‐GUARDING are NP‐hard for simple polygons. We prove that those problems are NP‐hard for ortho‐polygons, too.

Matrix representation and gradient flows

Matrix representation and gradient flows for NP-hard problems

✍ W. S. Wong 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 892 KB

Methods for solving degenerate problems

✍ K.N. Belash; A.A. Tret'yakov 📂 Article 📅 1988 🏛 Elsevier Science ⚖ 415 KB