Multilevel descriptions of classes decreasing the number of steps in solving pattern recognition problems described by propositional formulas
type: Item
instance of: scholarly article
title: Multilevel descriptions of classes decreasing the number of steps in solving pattern recognition problems described by propositional formulas
zbMATH Open document ID: 1328.68184
DOI: 10.3103/S1063454108010056
published in: Vestnik St. Petersburg University. Mathematics
publication date: 2008-09-22T00:00:00Z
Mathematics Subject Classification ID: 68T10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5345559
author: Tat'yana Matveevna Kosovskaya
MaRDI profile type: Publication
cites work: Solving satisfiability in less than \(2^ n\) steps
cites work: On the complexity of finding emerging patterns
full work available at URL: s1063454108010056
OpenAlex ID: W1998375050
Recommended article: Estimating the number of steps that it takes to solve some problems of pattern recognition which admit logical description
Recommended article: Q3806854
Recommended article: An algorithm for synthesizing correct recognition procedures for problems with non-intersecting classes
Recommended article: Predicate description of universal constraints in the algebraic approach to pattern recognition problems
Recommended article: Q5506364
Recommended article: Q4663362
Recommended article: A Complete Classification of the Complexity of Propositional Abduction
Recommended article: An algorithm of classification of unranked propositional logic formulas
description: scientific article; zbMATH DE number 5345559