Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems (Q3012844): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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-22006-7_59 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1232310145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Desirability of Acyclic Database Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Algebraic Formulas Using a Constant Number of Registers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dichotomy Theorem for Polynomial Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expressive power of CNF formulas of bounded tree- and clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness and reduction in algebraic complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting truth assignments of formulas of bounded tree-width or clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of acyclic conjunctive queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Valiant's algebraic complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Computation of Polynomials Using Few Processors / rank
 
Normal rank

Latest revision as of 06:51, 4 July 2024

scientific article
Language Label Description Also known as
English
Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems
scientific article

    Statements

    Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems (English)
    0 references
    0 references
    6 July 2011
    0 references
    0 references
    0 references