On extremal \(k\)-CNF formulas

DOI10.1016/j.ejc.2013.06.011zbMath1292.68118OpenAlexW2040256013MaRDI QIDQ2509734

Kazuyuki Amano

Publication date: 29 July 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2013.06.011

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Boolean functions (06E30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Uses Software

• nauty

Cites Work

• The average sensitivity of bounded-depth circuits
• Constant depth circuits, Fourier transform, and learnability
• An improved exponential-time algorithm for k -SAT
• Variable Influences in Conjunctive Normal Forms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On extremal \(k\)-CNF formulas