๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the complexity of test case generation for NP-hard problems

โœ Scribed by Laura A. Sanchis

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
562 KB
Volume
36
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the np-completeness of certain networ
On the np-completeness of certain network testing problems
โœ S. Even; O. Goldreich; S. Moran; P. Tong ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 946 KB

Let G ( V , E) be an undirected graph which describes the structure of a communication network. During the maintenance period every line must be tested in each of the two possible directions. A line is tested by assigning one of its endpoints t o be a transmitter, the other to be a receiver, and sen

On an Approximate Solution of the Dirich
On an Approximate Solution of the Dirichlet Problem for the Generalized Laplacian
โœ Nikolai N. Tarkhanov ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 750 KB

## Abstract For an arbitrary differential operator __P__ of order __p__ on an open set __X__ โŠ‚ R^n^, the Laplacian is defined by ฮ” = __P__\*__P__. It is an elliptic differential operator of order __2p__ provided the symbol mapping of __P__ is injective. Let __O__ be a relatively compact domain in _