Heuristic algorithms for obtaining Polynomial Threshold Functions with low densities

April 05, 2015 · The Ethereal · 🏛 Cologne Twente Workshop on Graphs and Combinatorial Optimization

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Can Eren Sezener, Erhan Oztop arXiv ID 1504.01167 Category cs.CC: Computational Complexity Cross-listed cs.NE Citations 1 Venue Cologne Twente Workshop on Graphs and Combinatorial Optimization Last Checked 6 months ago
Abstract
In this paper we present several heuristic algorithms, including a Genetic Algorithm (GA), for obtaining polynomial threshold function (PTF) representations of Boolean functions (BFs) with small number of monomials. We compare these among each other and against the algorithm of Oztop via computational experiments. The results indicate that our heuristic algorithms find more parsimonious representations compared to the those of non-heuristic and GA-based algorithms.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Computational Complexity