scientific article; zbMATH DE number 2083798
From MaRDI portal
Publication:4739596
zbMath1054.68060MaRDI QIDQ4739596
Publication date: 6 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2264/22640001.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)
Related Items (2)
On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes ⋮ On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's
This page was built for publication:
