arXiv (All)
open access
Implicit Computation of Filtered Prime Implicants
Prime implicants (PIs) are central in computer science, with applications in logic minimization, diagnosis, explainable formal methods and AI. Algorithms for the computation of PIs were first-and-foremost considered on the full input space, not considering the case where the input space might be con
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Efficient signatures of knowledge and DAA in the standard model#326529
- MATH HAS ONLY ONE LANGUAGE#699562
- Smarandache recursive arithmetic structures: Conjectures, open problems, and computational explorations#691366
- The Beauty and the Beast: Sok on Process Algebras and Cybersecurity#1178717
- The Divisor Mirror: A Geometric Invariant for Integer Structure#166990
Record · ID 999279
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive