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
Discussion
View source
View history
Purge
English
Log in

The monotone circuit complexity of quadratic Boolean functions

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

DOI10.1007/s00453-006-0073-0zbMath1100.68040OpenAlexW2056263286MaRDI QIDQ2509028

Kazuyuki Amano, Akira Maruoka

Publication date: 16 October 2006

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-006-0073-0


zbMATH Keywords

quadratic functionssingle level conjunctive complexity


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)








This page was built for publication: The monotone circuit complexity of quadratic Boolean functions

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2509028&oldid=15226045"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 03:23.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki