scientific article
From MaRDI portal
Publication:2911617
DOI10.4230/LIPIcs.FSTTCS.2011.115zbMath1246.68125MaRDI QIDQ2911617
B. V. Raghavendra Rao, M. N. Jayalal Sarma
Publication date: 31 August 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Isomorphism testing of Boolean functions computable by constant-depth circuits ⋮ Building above read-once polynomials: identity testing and hardness of representation
This page was built for publication:
