On the computational complexity of satisfiability in propositional logics of programs

Bogdan S. Chlebus

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Fingerprint

Dive into the research topics of 'On the computational complexity of satisfiability in propositional logics of programs'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science