Ackermann Encoding, Bisimulations, and OBDDs: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 14:5214:52, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,475 bytes +1,475‎ Created page with "Title: Ackermann Encoding, Bisimulations, and OBDDs Research Question: How can we efficiently represent and compute bisimulations for large graphs using Ackermann encoding and OBDDs? Methodology: The researchers propose an alternative method to represent graphs using OBDDs (Binary Decision Diagrams). This method is based on partitioning the graph nodes and using a shared OBDD for each partition. They also present a method to compute bisimulations and represent them usi..."
Retrieved from "https://simplesci.org/wiki/Ackermann_Encoding,_Bisimulations,_and_OBDDs"