Logical analysis of data with decomposable structures.
type: Item
instance of: scholarly article
title: Logical analysis of data with decomposable structures.
zbMATH Open document ID: 1061.68130
DOI: 10.1016/S0304-3975(01)00413-3
author: Hirotaka Ono
author: Kazuhisa Makino
author: Toshihide Ibaraki
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 1857104
zbMATH Keywords: Logical analysis of data
zbMATH Keywords: Boolean functions
zbMATH Keywords: Decomposable functions
zbMATH Keywords: Artificial intelligence
zbMATH Keywords: Approximation algorithms
MaRDI profile type: Publication
cites work: Q4004178
cites work: Q4258216
cites work: Decomposability of partially defined Boolean functions
cites work: Error-free and best-fit extensions of partially defined Boolean functions
cites work: Q3491589
cites work: Q4198056
cites work: Multiway cuts in directed and node weighted graphs
cites work: Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
cites work: Positive and Horn decomposability of partially defined Boolean functions
cites work: Q5655273
cites work: Boosting first-order learning
cites work: Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
description: scientific article; zbMATH DE number 1857104