Q3740117
type: Item
instance of: scholarly article
zbMATH Open document ID: 0603.65010
author: Henryk Kołacz
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 65D15
Mathematics Subject Classification ID: 65G30
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 65D32
zbMATH DE Number: 3974159
zbMATH Keywords: optimal algorithms
zbMATH Keywords: inclusion algorithms
zbMATH Keywords: computational complexity
zbMATH Keywords: range approximation
MaRDI profile type: Publication
Recommended article: Q3777330
Recommended article: On the complexity of exclusion algorithms for optimization
Recommended article: On approximate inclusion-exclusion
Recommended article: Optimal Inclusion of a Solution Set
Recommended article: Invitation to Algorithmic Uses of Inclusion–Exclusion
Recommended article: Estimates of the complexity of a method to solve the problem of inclusive search
Recommended article: Approximate inclusion-exclusion
Recommended article: A Generic Algorithm for Solving Inclusions
Recommended article: An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs
Recommended article: Algorithms for optimization problems with exclusion constraints
description: scientific article