An exponential lower bound on the size of algebraic decision trees for MAX
type: Item
instance of: scholarly article
title: An exponential lower bound on the size of algebraic decision trees for MAX
zbMATH Open document ID: 0918.68032
author: Marek Karpinski
author: Andrew Chi-Chih Yao
author: Dima Grigoriev
published in: Computational Complexity
publication date: 1999-02-02T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 1247752
zbMATH Keywords: computational complexity
zbMATH Keywords: algebraic decision trees
zbMATH Keywords: lower bounds
zbMATH Keywords: MAX problem
zbMATH Keywords: hypergraphs
zbMATH Keywords: minimal cutsets
MaRDI profile type: Publication
full work available at URL: s000370050010
OpenAlex ID: W1524291506
DOI: 10.1007/S000370050010
description: scientific article; zbMATH DE number 1247752