Disjunctive complexity

DOI10.1007/978-3-031-97100-6_10MaRDI QIDQ6884656zbMATH OpenFDO

Authors N. G. Ivanov, Alexander A. Rubtsov, Mikhail Vyalyi

Publication date 15 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-97100-6_10

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 2119719 (Why is no real title available?)
• An information statistics approach to data stream and communication complexity
• Boolean function complexity. Advances and frontiers.
• Computational Complexity
• Data streams: algorithms and applications.
• On universality of regular realizability problems
• Optimal streaming approximations for all Boolean Max-2CSPs and Max-kSAT
• The Space Complexity of Recognizing Well-Parenthesized Expressions in the Streaming Model: The Index Function Revisited
• The space complexity of approximating the frequency moments

This page was built for publication: Disjunctive complexity

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