Reviewing bounds on the circuit size of the hardest functions
type: Item
instance of: scholarly article
title: Reviewing bounds on the circuit size of the hardest functions
zbMATH Open document ID: 1185.68358
author: Gudmund S. Frandsen
author: Peter Bro Miltersen
published in: Information Processing Letters
publication date: 2009-12-04T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5642364
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.ipl.2005.03.009
OpenAlex ID: W2017637046
cites work: Q3249579
cites work: Almost everywhere high nonuniform complexity
cites work: Q4692286
cites work: Q3762226
cites work: Q4344138
DOI: 10.1016/J.IPL.2005.03.009
description: scientific article; zbMATH DE number 5642364