Estimating information amount under uncertainty: algorithmic solvability and computational complexity (Q3577034): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A NON-SPECIFICITY MEASURE FOR CONVEX SETS OF PROBABILITY DISTRIBUTIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: MAXIMUM OF ENTROPY FOR CREDAL SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Difference of entropies as a non-specificity function on credal sets† / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN ALGORITHM TO COMPUTE THE UPPER ENTROPY FOR ORDER-2 CAPACITIES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncertainty and Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncertainty-based information. Elements of generalized information theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum entropy and interval computations (September notes on summer impressions) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum entropy approach to fuzzy control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing population variance and entropy under interval uncertainty: Linear-time algorithms / rank
 
Normal rank

Latest revision as of 02:07, 3 July 2024

scientific article
Language Label Description Also known as
English
Estimating information amount under uncertainty: algorithmic solvability and computational complexity
scientific article

    Statements

    Estimating information amount under uncertainty: algorithmic solvability and computational complexity (English)
    0 references
    0 references
    0 references
    3 August 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    amount of information
    0 references
    uncertainty
    0 references
    probabilistic uncertainty
    0 references
    interval uncertainty
    0 references
    entropy
    0 references
    computational complexity
    0 references
    0 references