The complexity of languages of type UM

DOI10.1016/0041-5553(77)90019-2zbMATH Open0404.68051OpenAlexW1992036266MaRDI QIDQ4190140FDOQ4190140

Authors: 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

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

Cited In (3)

• Pseudodifferential operators in the theory of multiphase, multi-rate flows
• 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

This page was built for publication: The complexity of languages of type UM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4190140)