Research2021 Finding an injective mapping with restrictions for values is NP-CompleteContinue reading Finding an injective mapping with restrictions for values is NP-Complete Efficient algorithm for finding non-productive rules in context-free grammarsContinue reading Efficient algorithm for finding non-productive rules in context-free grammars 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 Gray codes and their beautiful symmetriesContinue reading Gray codes and their beautiful symmetries Measuring the size of a regular language is NP-HardContinue reading Measuring the size of a regular language is NP-Hard Efficient compression of congruence class automationsContinue reading Efficient compression of congruence class automations
Finding an injective mapping with restrictions for values is NP-CompleteContinue reading Finding an injective mapping with restrictions for values is NP-Complete
Efficient algorithm for finding non-productive rules in context-free grammarsContinue reading Efficient algorithm for finding non-productive rules in context-free grammars
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
Efficient compression of congruence class automationsContinue reading Efficient compression of congruence class automations
