Complexity theory2022 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 Finding an injective mapping with restrictions for values is NP-CompleteContinue reading Finding an injective mapping with restrictions for values is NP-Complete 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 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
Finding an injective mapping with restrictions for values is NP-CompleteContinue reading Finding an injective mapping with restrictions for values is NP-Complete
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
Measuring the size of a regular language is NP-HardContinue reading Measuring the size of a regular language is NP-Hard
