Finding the Description of Structure by Counting Method: A Case Study

DOI10.1007/978-3-642-18381-2_38zbMath1298.68072OpenAlexW1537509580WikidataQ60691835 ScholiaQ60691835MaRDI QIDQ3075538

Mati Tombak, Ahti Peder

Publication date: 15 February 2011

Published in: SOFSEM 2011: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18381-2_38

zbMATH Keywords

integer sequence{\#}SATfamily of propositional formulaesuperpositional graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Classical propositional logic (03B05) Data structures (68P05)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph-Based Algorithms for Boolean Function Manipulation
• Hipparchus, Plutarch, Schroder, and Hough

This page was built for publication: Finding the Description of Structure by Counting Method: A Case Study