Q3191587
type: Item
instance of: scholarly article
zbMATH Open document ID: 1323.06012
author: Daniel M. Kane
published in: Theory of Computing
publication date: 2014-10-06T00:00:00Z
Mathematics Subject Classification ID: 06E30
Mathematics Subject Classification ID: 06A06
Mathematics Subject Classification ID: 91B06
zbMATH DE Number: 6351494
zbMATH Keywords: Boolean functions
zbMATH Keywords: monotone functions
zbMATH Keywords: decision trees
MaRDI profile type: MaRDI publication profile
full work available at URL: toc.2013.v009a017
OpenAlex ID: W2183042438
cites work: Boolean functions with low average sensitivity depend on few coordinates
DOI: 10.4086/TOC.2013.V009A017
Recommended article: Partially monotonic decision trees
Recommended article: Learning Monotone Decision Trees in Polynomial Time
Recommended article: A Decision Procedure for Monotone Functions over Bounded and Complete Lattices
Recommended article: Power of decision trees with monotone queries
Recommended article: Una classe di funzioni monotone generalizzate
Recommended article: Monotone Boolean functions
Recommended article: Decision tree approximations of Boolean functions
Recommended article: Q3014325
description: scientific article; zbMATH DE number 6351494