Publication:4385521
From MaRDI portal
zbMath0900.68269MaRDI QIDQ4385521
Publication date: 4 May 1998
68Q25: Analysis of algorithms and problem complexity
94A60: Cryptography
11Y16: Number-theoretic algorithms; complexity
Related Items
A comparison of two lower bound methods for communication complexity, Best-order streaming model, Planar bus graphs, The foundation of self-developing blob machines for spatial computing, On the P versus NP intersected with co-NP question in communication complexity, A lower bound for area-universal graphs, A comparison of two lower-bound methods for communication complexity, Lower bounds for one-way probabilistic communication complexity and their application to space complexity, Parallel evaluation of arithmetic circuits