The complexity of languages of type UM

DOI10.1016/0041-5553(77)90019-2zbMath0404.68051OpenAlexW1992036266MaRDI QIDQ4190140

R. G. Nigmatullin

Publication date: 1978

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(77)90019-2

zbMATH Keywords

LanguageComputational ComplexityDisjunctive Normal FormMinimization of Boolean Functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Logical aspects of Boolean algebras (03G05) Algorithms in computer science (68W99)

Related Items

Propagation of waves and dispersed-phase concentration discontinuities in a gas-fluidized bed of weakly interacting particles, Structure of the equations of hydrodynamics for a medium consisting of inelastic rough spheres, Pseudodifferential operators in the theory of multiphase, multi-rate flows