Journal of Automation and Information Sciences
Publication de 12 numéros par an
ISSN Imprimer: 1064-2315
ISSN En ligne: 2163-9337
SJR:
0.173
SNIP:
0.588
CiteScore™::
2
Indexed in
Principles of Designing PDC Algorithms for Intractable Combinatorial Problems
Volume 29,
Numéro 2-3, 1997,
pp. 36-40
DOI: 10.1615/JAutomatInfScien.v29.i2-3.70
RÉSUMÉ
A new approach to constructing efficient exact algorithms for hard combinatorial problems is suggested. Concepts of a PDC problem and a PDC algorithm (algorithm that contains both polynomial and decompositional components) are introduced.
371 Vues d'articles
2 Téléchargements d'articles
Métrique
Articles avec un contenu similaire:
Dernier numéro
Modeling of Configurations Formed when Using Microneedle Systems
Properties of Large Deviations of Empirical Estimates in a Stochastic Optimization Problem for a Homogeneous Random Field
The Dynamics of One Arms Race Mathematical Model with a Delay
Some Ways to Modeling Input Data for Information Search in the Library of Standards when Solving Semantics Problems
Method for Constructing Primitive Polynomials for Cryptographic Subsystems of Dependable Automated Systems
Complete Asymptotics of Approximations by Certain Singular Integrals in Mathematical Modeling
Index, Volume 52, 2020