Recognition problems and communication complexity.

DOI10.1016/S0166-218X(03)00192-6MaRDI QIDQ1422409zbMATH OpenOpenAlexFDO

Authors Gábor Wiener

Publication date 14 February 2004

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(03)00192-6

zbMATH Keywords

Combinatorial searchPartially ordered setCommunication complexityRecognition complexity

Mathematics Subject Classification ID

Communication theory (94A05) Theory of questionnaires (94A50)

Recommendations

• Communication Complexity
• scientific article; zbMATH DE number 107798
• Communication complexity tools on recognizable picture languages
• scientific article; zbMATH DE number 4028940
• On the complexity of communication complexity
• Communication complexity of two decision problems
• scientific article; zbMATH DE number 4197419
• scientific article; zbMATH DE number 1361468
• The complexity of the realization of certain recognition procedures

Cites work

• scientific article; zbMATH DE number 3943825 (Why is no real title available?)
• scientific article; zbMATH DE number 41347 (Why is no real title available?)
• Communication Complexity
• Rounds in combinatorial search
• The theory of convex geometries

Cited in

(2)

• Combinatorial algorithms making support of managerial decisions
• scientific article; zbMATH DE number 4028940 (Why is no real title available?)

This page was built for publication: Recognition problems and communication complexity.

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