scientific article; zbMATH DE number 1142305
From MaRDI portal
zbMath0900.68269MaRDI QIDQ4385521
Publication date: 4 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items
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, A comparison of two lower bound methods for communication complexity, The foundation of self-developing blob machines for spatial computing, Best-order streaming model, Planar bus graphs, On the P versus NP intersected with co-NP question in communication complexity