scientific article; zbMATH DE number 4025336

zbMATH Open0629.94021MaRDI QIDQ3767261FDOQ3767261

Authors: E. Toman 

Publication date: 1986

Title of this publication is not available (Why is that?)

Recommendations

• Local complexity of Boolean functions
• Approximation of Boolean functions by local search
• On the complexity of computing a random Boolean function over the reals
• scientific article; zbMATH DE number 11735
• scientific article; zbMATH DE number 4025337
• Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
• scientific article; zbMATH DE number 3916176
• Locally random reductions: Improvements and applications
• An exponential separation between randomized and deterministic complexity in the LOCAL model
• Efficient probabilistic algorithm for estimating the algebraic properties of Boolean functions for large \(n\)

zbMATH Keywords

disjunctive normal formslocal algorithmsrandom Boolean functions

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (06E30) Measures on Boolean rings, measure algebras (28A60)

Cited In (3)

• Approximation of Boolean functions by local search
• Title not available (Why is that?)
• Local complexity of Boolean functions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3767261)