Finding Reductions Automatically
DOI10.1007/978-3-642-15025-8_10zbMATH Open1287.68024OpenAlexW2110020743MaRDI QIDQ3586003FDOQ3586003
Authors: Michael S. Crouch, J. Eliot B. Moss, Neil Immerman 
Publication date: 3 September 2010
Published in: Fields of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15025-8_10
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
Decidability of theories and sets of sentences (03B25) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Complexity of computation (including implicit computational complexity) (03D15)
Cites Work
- Theory and Applications of Satisfiability Testing
- Title not available (Why is that?)
- Propositional semantics for disjunctive logic programs
- On the Structure of Polynomial Time Reducibility
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The complexity of satisfiability problems
- Elements of finite model theory.
- Answer set programming based on propositional satisfiability
- Languages that Capture Complexity Classes
- Title not available (Why is that?)
- Undirected ST-connectivity in log-space
- Reducibility by algebraic projections
- Why are there so many loop formulas?
- The complexity of satisfiability problems: Refining Schaefer's theorem
Cited In (3)
Uses Software
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)
