An approximation trichotomy for Boolean \#CSP (Q972385): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Mark R. Jerrum / rank
Normal rank
 
Property / author
 
Property / author: Mark R. Jerrum / rank
 
Normal rank
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.2009.08.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964923287 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56323828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bases for Boolean co-clones / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Counting Constraint Satisfaction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a dichotomy theorem for the counting constraint satisfaction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of partition functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of generalized satisfiability counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Classifications of Boolean Constraint Satisfaction 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: The relative complexity of approximate counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Weighted Boolean #CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4521549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of combinatorial structures from a uniform distribution / 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: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3184605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:18, 2 July 2024

scientific article
Language Label Description Also known as
English
An approximation trichotomy for Boolean \#CSP
scientific article

    Statements

    An approximation trichotomy for Boolean \#CSP (English)
    0 references
    0 references
    0 references
    0 references
    25 May 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    combinatorial enumeration
    0 references
    computational complexity
    0 references
    constraint satisfaction problems
    0 references
    0 references
    0 references