Almost every 2-SAT function is unate

DOI10.1007/s11856-007-0081-zzbMath1141.68033OpenAlexW2064447024MaRDI QIDQ2480593

Yanyan Li

Publication date: 1 April 2008

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11856-007-0081-z

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Exact enumeration problems, generating functions (05A15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ The number of 3-SAT functions ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ On the Number of 2-SAT Functions ⋮ Булевы биюнктивные функции, графы 2-КНФ и их порядковые функции. Оценки веса биюнктивной функции с заданным числом слоев

Cites Work

• The number of 2-SAT functions
• The average number of linear extensions of a partial order
• On the structure of clique-free graphs
• The maximum number of edges in a minimal graph of diameter 2
• Asymptotic Enumeration of Partial Orders on a Finite Set
• The number of k‐SAT functions

This page was built for publication: Almost every 2-SAT function is unate