Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Constant-depth circuits vs. monotone circuits

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

DOI10.4230/LIPICS.CCC.2023.29MaRDI QIDQ6640366FDOQ6640366


Authors: Bruno Pasqualotto Cavalar, Igor C. Oliveira Edit this on Wikidata


Publication date: 19 November 2024






zbMATH Keywords

circuit complexitybounded-depth circuitsmonotone circuit complexityconstraint-satisfaction problems


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)







This page was built for publication: Constant-depth circuits vs. monotone circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6640366)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6640366&oldid=40209748"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 13 February 2025, at 19:37. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki