scientific article; zbMATH DE number 3644482
Boolean networkcomplexity of satisfiabilitydecision problemsnetwork complexitypropositional logicsatisfiability of Boolean formulas in conjunctive normal formtwo-dimensional vector machine
Classical propositional logic (03B05) Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05) Complexity of computation (including implicit computational complexity) (03D15) Logical aspects of Boolean algebras (03G05) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3049815)
