On convex complexity measures
- 1 March 2010
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 411 (16-18) , 1842-1854
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Lower bounds in communication complexity based on factorization normsRandom Structures & Algorithms, 2008
- Negative weights make adversaries stronger2007
- THE QUANTUM ADVERSARY METHOD AND CLASSICAL FORMULA SIZE LOWER BOUNDScomputational complexity, 2006
- The Shrinkage Exponent of de Morgan Formulas is 2SIAM Journal on Computing, 1998
- Fractional Covers and Communication ComplexitySIAM Journal on Discrete Mathematics, 1995
- Improvements on Khrapchenko's theoremTheoretical Computer Science, 1993
- Monotone Circuits for Connectivity Require Super-Logarithmic DepthSIAM Journal on Discrete Mathematics, 1990
- Applications of matrix methods to the theory of lower bounds in computational complexityCombinatorica, 1990
- On notions of information transfer in VLSI circuits1983
- Method of determining lower bounds for the complexity of P-schemesMathematical Notes, 1971