Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight (Q3007678): 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.1007/978-3-642-21581-0_11 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1831347135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Acyclic Conjunctive Queries and Constant Delay Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable decision for a constraint language implies tractable search / 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: Complexity of constraints. An overview of current research themes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonuniform Boolean constraint satisfaction problems with cardinality constraint / 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: Lower bounds for three algorithms for transversal hypergraph generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic structure of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to the Maximum Solution Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graph coloring is not self-reducible, assuming P\(\neq NP\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness of Losing Weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating All Solutions for Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Polymorphisms and Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of the Monomials of a Polynomial and Related Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the problems of enumerating cuts by non-decreasing weights / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:51, 4 July 2024

scientific article
Language Label Description Also known as
English
Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight
scientific article

    Statements

    Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight (English)
    0 references
    0 references
    0 references
    0 references
    17 June 2011
    0 references
    enumeration
    0 references
    complexity
    0 references
    polynomial delay
    0 references
    generalized satisfiability
    0 references
    CSP
    0 references

    Identifiers