FRAGMENTS OF APPROXIMATE COUNTING (Q2921008): 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 / OpenAlex ID
 
Property / OpenAlex ID: W2125998724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded arithmetic and the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the weak pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structures interpretable in models of bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A model-theoretic characterization of the weak pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The provably total search problems of bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Switching Lemma for Small Restrictions and Lower Bounds for <i>k</i>-DNF Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating minima and maxima, Nash equilibria and bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds to the size of constant-depth propositional proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The provably total NP search problems of weak second order bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate counting by hashing in bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Independence of Variants of the Weak Pigeonhole Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strength of sharply bounded induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual weak pigeonhole principle, Boolean complexity, and derandomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5286672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3794177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting independence results in bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strength of sharply bounded induction requires MSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs are narrow—resolution made simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: POLYNOMIAL LOCAL SEARCH IN THE POLYNOMIAL HIERARCHY AND WITNESSING IN FRAGMENTS OF BOUNDED ARITHMETIC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provability of the pigeonhole principle and the existence of infinitely many primes / rank
 
Normal rank

Latest revision as of 03:11, 9 July 2024

scientific article
Language Label Description Also known as
English
FRAGMENTS OF APPROXIMATE COUNTING
scientific article

    Statements

    FRAGMENTS OF APPROXIMATE COUNTING (English)
    0 references
    0 references
    0 references
    30 September 2014
    0 references
    approximate counting
    0 references
    bounded arithmetic
    0 references
    ordering principle
    0 references
    weak pigeonhole principle
    0 references
    random resolution
    0 references
    polynomial local search
    0 references

    Identifiers