CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Filters
2 research outputs found
A
2.5
n
2.5n
2.5
n
-Lower Bound on the Combinational Complexity of Boolean Functions
Author
Hrapcenko V. M.
Lupanov O. B.
+10Â more
Mehlhorn Kurt
Meyer A.
Neciporuk E. I.
Savage John E.
Schnorr C. P.
Schnorr C. P.
Schnorr C.-P.
Shannon C. E.
Stockmeyer L. J.
Wolfgang J. Paul
Publication venue
'Society for Industrial & Applied Mathematics (SIAM)'
Publication date
Field of study
No full text
Crossref
Satisfiability models and algorithms for circuit delay computation
Author
ASHAR P.
BAYARDO JR.
+18Â more
BENKOSKI J.
BERGAMASCHI R.
CHEN H.-C.
DEVADAS S.
GUERRA ILVA
GUERRA ILVA
HRAPCENKO V.
João Marques-Silva
Karem A. Sakallah
L. Miguel Silveira
LARRABEE T.
LI C. M.
LuÃs Guerra e Silva
MARQUES-SILVA J.
MARQUES-SILVA J.
MCGEER P. C.
YALCIN H.
ZHANG H.
Publication venue
'Association for Computing Machinery (ACM)'
Publication date
Field of study
No full text
Crossref