Finding Reductions Automatically
From MaRDI portal
Publication:3586003
Recommendations
- Simplifying reductions
- Reducing the complexity of reductions
- scientific article; zbMATH DE number 1559593
- Automata for reduction properties solving
- Automatic Generation of Optimal Reductions of Distributions
- Publication:4934278
- scientific article; zbMATH DE number 3982555
- scientific article; zbMATH DE number 1047677
- scientific article; zbMATH DE number 2165788
- Algorithm of finding the best reduction based on reduction significance
Cites work
- scientific article; zbMATH DE number 3976287 (Why is no real title available?)
- scientific article; zbMATH DE number 1324669 (Why is no real title available?)
- Answer set programming based on propositional satisfiability
- Elements of finite model theory.
- Languages that Capture Complexity Classes
- On the Structure of Polynomial Time Reducibility
- Propositional semantics for disjunctive logic programs
- Reducibility by algebraic projections
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The complexity of satisfiability problems
- The complexity of satisfiability problems: Refining Schaefer's theorem
- Theory and Applications of Satisfiability Testing
- Undirected ST-connectivity in log-space
- Why are there so many loop formulas?
Cited in
(3)
This page was built for publication: Finding Reductions Automatically
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586003)