Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

On estimates on the complexity of restrictions of Boolean functions

From MaRDI portal
Publication:1380287
Jump to:navigation, search

zbMath0891.94012MaRDI QIDQ1380287

A. V. Chashkin

Publication date: 23 May 1998

Published in: Doklady Mathematics (Search for Journal in Brave)


zbMATH Keywords

computational complexitypartial Boolean functioncircuit realization


Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Boolean functions (06E30)


Related Items (2)

Lower bounds for the complexity of restrictions of Boolean functions ⋮ Local complexity of Boolean functions







This page was built for publication: On estimates on the complexity of restrictions of Boolean functions

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1380287&oldid=13538757"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 15:45.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki