EUVIMEDEUVIMED entdecken
Crossref

An Offline Tree-Based Breadth-First Search Two-Level Minimization Approach for Reducing the Number of Boolean Operators in Boolean Functions

Shima Tabibian, Babak Nasersharif

Iranian Journal of Science and Technology, Transactions of Electrical Engineering · 04.05.2026

DOI: 10.1007/s40998-026-01079-2 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Iranian Journal of Science and Technology, Transactions of Electrical Engineering, online erschienen am 04.05.2026. Verfasst von Shima Tabibian und 1 weiteren Autor:innen. Die Arbeit nennt 65 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Tabibian, S., & Nasersharif, B. (2026). An Offline Tree-Based Breadth-First Search Two-Level Minimization Approach for Reducing the Number of Boolean Operators in Boolean Functions. Iranian Journal of Science and Technology, Transactions of Electrical Engineering. https://doi.org/10.1007/s40998-026-01079-2

Vancouver

Tabibian S, Nasersharif B. An Offline Tree-Based Breadth-First Search Two-Level Minimization Approach for Reducing the Number of Boolean Operators in Boolean Functions. Iranian Journal of Science and Technology, Transactions of Electrical Engineering. 2026. doi:10.1007/s40998-026-01079-2

BibTeX
@article{Tabibian2026,
  author = {Tabibian, Shima and Nasersharif, Babak},
  title = {An Offline Tree-Based Breadth-First Search Two-Level Minimization Approach for Reducing the Number of Boolean Operators in Boolean Functions},
  journal = {Iranian Journal of Science and Technology, Transactions of Electrical Engineering},
  year = {2026},
  doi = {10.1007/s40998-026-01079-2}
}
Kostenlos starten →