On convex complexity measures

Number of the records: 1

1.

SYSNO ASEP	0342826
Document Type	J - Journal Article
R&D Document Type	Journal Article
Subsidiary J	Článek ve WOS
Title	On convex complexity measures
Author(s)	Hrubeš, P. (US) Jukna, S. (DE) Kulikov, A. (DE) Pudlák, Pavel (MU-W)_{RID, SAI}
Number of authors	4
Source Title	Theoretical Computer Science. - : Elsevier - ISSN 0304-3975 Roč. 411, 16-18 (2010), s. 1842-1854
Number of pages	13 s.
Language	eng - English
Country	NL - Netherlands
Keywords	boolean formula ; complexity measure ; combinatorial rectangle ; convexity
Subject RIV	BA - General Mathematics
R&D Projects	IAA1019401 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
CEZ	AV0Z10190503 - MU-W (2005-2011)
UT WOS	000276167000016
EID SCOPUS	77949275187
DOI	10.1016/j.tcs.2010.02.004
Annotation	Khrapchenko's classical lower bound n(2) on the formula size of the parity function f can be interpreted as designing a suitable measure of sub-rectangles of the combinatorial rectangle f(-1)(0) x f(-1)(1). Trying to generalize this approach we arrived at the concept of convex measures. We prove the negative result that convex measures are bounded by O(n(2)) and show that several measures considered for proving lower bounds on the formula size are convex. We also prove quadratic upper bounds on a class of measures that are not necessarily convex.
Workplace	Mathematical Institute
Contact	Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757
Year of Publishing	2011

Number of the records: 1