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

Graph methods for recognition of CMOS gates in transistor-level circuits

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

DOI10.17223/20710410/64/4MaRDI QIDQ6573399FDOQ6573399


Authors: Dmitrij I. Cheremisinov, L. D. Cheremisinova Edit this on Wikidata


Publication date: 16 July 2024

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)






zbMATH Keywords

graph isomorphismCMOS transistor circuitlogic gate recognitionSPICE formatsubcircuit extraction


Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)


Cites Work

  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs






This page was built for publication: Graph methods for recognition of CMOS gates in transistor-level circuits

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

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