Logic2022 Visualization and detailed description of the interactive protocol for TQBF yielding IP = PSPACEContinue reading Visualization and detailed description of the interactive protocol for TQBF yielding IP = PSPACE 2021 Constructing Hilbert-style F0 proofs with a simple graph-based notationContinue reading Constructing Hilbert-style F0 proofs with a simple graph-based notation Satisfiability of formulas with both Horn and 2-SAT clauses is NP-CompleteContinue reading Satisfiability of formulas with both Horn and 2-SAT clauses is NP-Complete How propositional logic minimization and gray codes are connectedContinue reading How propositional logic minimization and gray codes are connected 2020 Measuring the size of a regular language is NP-HardContinue reading Measuring the size of a regular language is NP-Hard
Visualization and detailed description of the interactive protocol for TQBF yielding IP = PSPACEContinue reading Visualization and detailed description of the interactive protocol for TQBF yielding IP = PSPACE
Constructing Hilbert-style F0 proofs with a simple graph-based notationContinue reading Constructing Hilbert-style F0 proofs with a simple graph-based notation
Satisfiability of formulas with both Horn and 2-SAT clauses is NP-CompleteContinue reading Satisfiability of formulas with both Horn and 2-SAT clauses is NP-Complete
How propositional logic minimization and gray codes are connectedContinue reading How propositional logic minimization and gray codes are connected
Measuring the size of a regular language is NP-HardContinue reading Measuring the size of a regular language is NP-Hard
