Completeness Results for Counting Problems with Easy Decision (Q5283355): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the solution‐space geometry of random constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Formulas Have Frozen Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A very hard log-space counting class / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the connection between interval size functions and path counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate counting by dynamic programming / 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: Approximately Counting $H$-Colorings is $\#\mathrm{BIS}$-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Ferromagnetic Ising with Local Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for #Knapsack and Related Counting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Computing the Size of an Interval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte-Carlo approximation algorithms for enumeration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4415064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the Efficiency of Backtrack Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On counting and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Functions with Easy Decision Version / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptive complexity of \(\#\)P functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate counting, uniform generation and rapidly mixing Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank

Latest revision as of 04:41, 14 July 2024

scientific article; zbMATH DE number 6751051
Language Label Description Also known as
English
Completeness Results for Counting Problems with Easy Decision
scientific article; zbMATH DE number 6751051

    Statements

    Completeness Results for Counting Problems with Easy Decision (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 July 2017
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references