Descriptive complexity of \#P functions: a new perspective (Q2220444): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptive complexity of \(\#\)P functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical characterization of the counting hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A model-theoretic characterization of constant-depth arithmetic circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5144698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting of Teams in First-Order Team Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniformity within \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4267800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtractive reductions and complete problems for counting complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2833177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph properties checkable in linear time in the number of vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy for nondeterministic time complexity / rank
 
Normal rank

Latest revision as of 09:13, 24 July 2024

scientific article
Language Label Description Also known as
English
Descriptive complexity of \#P functions: a new perspective
scientific article

    Statements

    Descriptive complexity of \#P functions: a new perspective (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 January 2021
    0 references
    finite model theory
    0 references
    arithmetic circuits
    0 references
    counting classes
    0 references
    Skolem function
    0 references

    Identifiers