Quantified constraint satisfaction and the polynomially generated powers property (Q539977): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00012-011-0125-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046586055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction Problems of Bounded Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Varieties with few subalgebras of powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Algorithm for Mal'tsev Constraints / 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: A dichotomy theorem for constraint satisfaction problems on a 3-element set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution for quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressive rate of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / 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: Generalized Majority-Minority Operations are Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capturing complexity classes by fragments of second-order logic / 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: Closure properties of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tractability and congruence distributivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3739181 / rank
 
Normal rank

Latest revision as of 03:26, 4 July 2024

scientific article
Language Label Description Also known as
English
Quantified constraint satisfaction and the polynomially generated powers property
scientific article

    Statements

    Quantified constraint satisfaction and the polynomially generated powers property (English)
    0 references
    0 references
    1 June 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references