Properties and applications of Boolean function composition
From MaRDI portal
Recommendations
Cites work
- A model of interactive teaching
- A theory of goal-oriented communication
- A theory of the learnable
- Algorithmic Learning Theory
- Derandomizing polynomial identity tests means proving circuit lower bounds
- scientific article; zbMATH DE number 3154781 (Why is no real title available?)
- scientific article; zbMATH DE number 67625 (Why is no real title available?)
- scientific article; zbMATH DE number 67631 (Why is no real title available?)
- scientific article; zbMATH DE number 1559537 (Why is no real title available?)
- In search of an easy witness: Exponential time vs. probabilistic polynomial time.
- Learning from different teachers
- Measuring teachability using variants of the teaching dimension
- Models of cooperative teaching and learning
- Occam's razor
- On specifying Boolean functions by labelled examples
- On the complexity of teaching
- On the limits of efficient teachability
- On the power of inductive inference from good examples
- Pseudorandom generators for space-bounded computation
- Recent Developments in Algorithmic Teaching
- Teachability in computational learning
- Teaching a smarter learner.
- Teaching Randomized Learners
Cited in
(32)- Composition limits and separating examples for some Boolean function complexity measures
- On block sensitivity and fractional block sensitivity
- An asymptotically tight bound on the number of relevant variables in a bounded degree Boolean function
- On separation between the degree of a Boolean function and the block sensitivity
- On derandomized composition of Boolean functions
- Composition of Boolean functions: an application to the secondary constructions of bent functions
- Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
- Alternation, sparsity and sensitivity: bounds and exponential gaps
- On fractional block sensitivity
- All classical adversary methods are equivalent for total functions
- scientific article; zbMATH DE number 4125344 (Why is no real title available?)
- scientific article; zbMATH DE number 6913819 (Why is no real title available?)
- LOW-DEGREE BOOLEAN FUNCTIONS ON , WITH AN APPLICATION TO ISOPERIMETRY
- Low-sensitivity functions from unambiguous certificates
- scientific article; zbMATH DE number 7559433 (Why is no real title available?)
- New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity
- A composition theorem for randomized query complexity via max-conflict complexity
- Properties of Switch-List Representations of Boolean Functions
- A composition theorem for randomized query complexity
- scientific article; zbMATH DE number 7733107 (Why is no real title available?)
- scientific article; zbMATH DE number 7789149 (Why is no real title available?)
- On query complexity measures and their relations for symmetric functions
- The power of many samples in query complexity
- Randomized query composition and sabotage complexity
- Separations between combinatorial measures for transitive functions
- Randomized query composition and product distributions
- Approximate degree composition for recursive functions
- Decision tree complexity versus block sensitivity and degree
- Relations between monotone complexity measures based on decision tree complexity
- On the fine-grained query complexity of symmetric functions
- Sensitivity conjecture and signed hypercubes
- Lifting to randomized parity decision trees
This page was built for publication: Properties and applications of Boolean function composition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986892)
