scientific article; zbMATH DE number 4022600

MaRDI QIDQ3765218zbMATH OpenFDO

Authors

Publication date 1987

zbMATH Keywords

CommunicationComputationMorristown/New JerseyPalo Alto/CaliforniaWorkshop

Mathematics Subject Classification ID

Problem books (00A07) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06)

Recommendations

• An overview of computational complexity
• Communication Complexity
• scientific article; zbMATH DE number 1361468
• scientific article; zbMATH DE number 194098
• scientific article; zbMATH DE number 107798

Cited in

(8)

• Graph coloring bounds for cellular radio
• An efficient upper bound of the rotation distance of binary trees
• Mean width of regular polytopes and expected maxima of correlated Gaussian variables
• Flipping in spirals
• Imperfect information as a source of non-symmetry in the two envelope problem
• Optimal selection problems based on exchangeable trials
• Proof of Conway’s lost cosmological theorem
• Limits for rumor spreading in stochastic populations

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