Publication:6160890: Difference between revisions
From MaRDI portal
Publication:6160890
Created automatically from import240710060729 |
(No difference)
|
Latest revision as of 06:49, 10 July 2024
Publication date: 2 June 2023
Title of this publication is not available (Why is that?)
Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distance in graphs (05C12)
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- On the Hamming distance between almost all Boolean functions 👍 👎
- A Boolean measure of similarity 👍 👎
- Distance generated by a fuzzy compatibility 👍 👎
- Approximating the Distance to Monotonicity of Boolean Functions 👍 👎
- Approximating the distance to monotonicity of Boolean functions 👍 👎
- A New Transform Related to Distance from a Boolean Function (Extended Abstract) 👍 👎
- A New Transform Related to Distance From a Boolean Function 👍 👎
- The Boolean map distance: theory and efficient computation 👍 👎
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160890)
