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

An efficient algorithm to generate prime implicants

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

DOI10.1023/A:1005940031099zbMath0929.03018OpenAlexW1978916005MaRDI QIDQ1283201

A. K. Shiny, Arun K. Pujari

Publication date: 12 January 2000

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1005940031099


zbMATH Keywords

recursive algorithmprime implicantknowledge compilationhypothetical reasoningprime paths


Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Classical propositional logic (03B05)








This page was built for publication: An efficient algorithm to generate prime implicants

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