On the computational power of Boolean decision lists
type: Item
instance of: scholarly article
title: On the computational power of Boolean decision lists
zbMATH Open document ID: 1105.68043
author: Matthias Krause
published in: Computational Complexity
publication date: 2006-11-17T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q32
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 06E30
zbMATH DE Number: 5073645
zbMATH Keywords: Decision lists
zbMATH Keywords: learnability
zbMATH Keywords: lower bounds
MaRDI profile type: Publication
full work available at URL: s00037-005-0203-0
OpenAlex ID: W2070053951
DOI: 10.1007/S00037-005-0203-0
Recommended article: Q4736855
Recommended article: Q3081631
Recommended article: Decision lists and related Boolean functions
Recommended article: On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs
Recommended article: On the size of binary decision diagrams representing Boolean functions
Recommended article: On the Power of Choice for Boolean Functions
Recommended article: The complexity hierarchy of Boolean bases
Recommended article: Q3137193
Recommended article: On the complexity of restrictions of Boolean functions
Recommended article: On complexity of a particular Boolean functions class
description: scientific article; zbMATH DE number 5073645