Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case (Q2275907): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: JBool / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2010.05.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1863337174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Mathematics of Neural Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint Products and Efficient Computation of Reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2715704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection of relevant features and examples in machine learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagnosing double regular systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query strategies for priced information / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new strategy for querying priced information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function Evaluation Via Linear Programming in the Priced Information Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the competitive ratio of evaluating priced functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive evaluation of threshold functions in the priced information model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to assign votes in a distributed system / rank
 
Normal rank
Property / cites work
 
Property / cites work: On read-once threshold formulae and their randomized decision tree complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized vs. deterministic decision tree complexity for read-once Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5562602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two applications of information complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning with attribute costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial characterization of read-once formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds to Complexities of Networks for Sorting and for Switching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on probabilistic linear decision trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3775483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal decision trees and one-time-only branching programs for symmetric Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762226 / rank
 
Normal rank

Latest revision as of 09:52, 4 July 2024

scientific article
Language Label Description Also known as
English
Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case
scientific article

    Statements

    Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 August 2011
    0 references
    0 references
    Boolean function
    0 references
    symmetric function
    0 references
    competitive analysis
    0 references
    decision tree
    0 references
    function evaluation
    0 references
    0 references