Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem (Q2221799): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2020.10.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3102682405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4993594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Definability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse NP problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure identification of Boolean relations and plain bases for co-clones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all solutions of generalized satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed systems of functions and predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing NP-intermediate problems by blowing holes with parameters of various properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong partial clones and the time complexity of SAT problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Inverse Satisfiability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak bases of Boolean co-clones / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of primitive positive definitions with polynomially many variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function Algebras on Finite Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebras of partial functions and their invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3739182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Polymorphisms and Constraint Satisfaction Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:22, 24 July 2024

scientific article
Language Label Description Also known as
English
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem
scientific article

    Statements

    Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem (English)
    0 references
    0 references
    0 references
    2 February 2021
    0 references
    clone theory
    0 references
    universal algebra
    0 references
    satisfiability problems
    0 references
    constraint satisfaction problems
    0 references
    inverse problems
    0 references

    Identifiers