The complexity of counting quantifiers on equality languages (Q515549): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Classifying the Complexity of Constraints Using Finite Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy theorem for constraint satisfaction problems on a 3-element set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of equality constraint languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantified Equality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction with Counting Quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4332930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3735686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantifiers and cognition: logical and computational perspectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniformity within \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reducts of equality up to primitive positive interdefinability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Abduction for Equality Constraint Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of constraint satisfaction games and QCSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive First-Order Logic Is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected connectivity in log-space / rank
 
Normal rank

Latest revision as of 13:07, 13 July 2024

scientific article
Language Label Description Also known as
English
The complexity of counting quantifiers on equality languages
scientific article

    Statements

    The complexity of counting quantifiers on equality languages (English)
    0 references
    0 references
    0 references
    0 references
    16 March 2017
    0 references
    quantified constraints
    0 references
    counting quantifiers
    0 references
    constraint satisfaction
    0 references
    equality language
    0 references
    computational complexity
    0 references

    Identifiers