Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). II

DOI10.1007/S10559-006-0018-2zbMath1104.68720OpenAlexW4242136205MaRDI QIDQ852241

Anatoli N. Chebotarev, S. L. Kryvyi

Publication date: 28 November 2006

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-006-0018-2

zbMATH Keywords

data representationestimation of complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Cites Work

• Approach to functional specification of automaton systems. I

This page was built for publication: Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). II