scientific article; zbMATH DE number 6382918

zbMATH Open1302.90263MaRDI QIDQ2935596FDOQ2935596

Naoyuki Kamiyama

Publication date: 30 December 2014

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

zbMATH Keywords

computational complexityBoolean function complexityprotocol partition number

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60)

Cited In (2)

• Bounds for the number of Boolean functions admitting quadratic approximations of given accuracy
• Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory

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 Q2935596)