The following pages link to On converting CNF to DNF (Q2576880):
Displaying 9 items.
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Improving resolution width lower bounds for \(k\)-CNFs with applications to the strong exponential time hypothesis (Q894453) (← links)
- On the structure and the number of prime implicants of 2-\(\mathsf{CNF}\)s (Q906424) (← links)
- On the resolution and optimization of a system of fuzzy relational equations with sup-\(T\) composition (Q1028709) (← links)
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints (Q2074672) (← links)
- Static analysis and stochastic search for reachability problem (Q2229143) (← links)
- Cryptanalysis of Boyen's attribute-based encryption scheme in TCC 2013 (Q2673979) (← links)
- ON THE HARDNESS AGAINST CONSTANT-DEPTH LINEAR-SIZE CIRCUITS (Q3084685) (← links)
