The communication complexity of enumeration, elimination, and selection (Q5956009): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2105010107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded queries to SAT and the Boolean hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Terse, superterse, and verbose sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of ODD<sub><i>n</i></sub><sup><i>A</i></sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantifying the amount of verboseness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the direct sum conjecture in the straight line model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerative counting is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on enumerative counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the direct sum conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded queries in recursion theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between communication complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of semi-feasible algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semirecursive Sets and Positive Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Communication Complexity of Set Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-logarithmic depth lower bounds via the direct sum in communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On self-reducibility and weak P-selectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Beigel's cardinality conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Global'' graph problems tend to be intractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication complexity and combinatorial lattice theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphieeigenschaften und mittlere Kantendichte von Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Membership Comparable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cardinality version of Beigel's nonspeedup theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizing Boolean functions on disjoint sets of variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distributional complexity of disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the density of families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analogues of semirecursive sets and effective reducibilities to the study of NP complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reductions on NP and p-selective sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On membership comparable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4047029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:56, 3 June 2024

scientific article; zbMATH DE number 1708329
Language Label Description Also known as
English
The communication complexity of enumeration, elimination, and selection
scientific article; zbMATH DE number 1708329

    Statements

    The communication complexity of enumeration, elimination, and selection (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 April 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers