𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A New Lower Bound for the L1 Mean of the Exponential Sum with the MoBius Function

✍ Scribed by Balog, A.; Ruzsa, I. Z.

Book ID
111974220
Publisher
Oxford University Press
Year
1999
Tongue
English
Weight
136 KB
Volume
31
Category
Article
ISSN
0024-6093

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A sharp lower bound for the circumferenc
A sharp lower bound for the circumference of 1-tough graphs with large degree sums
✍ Vu Dinh Hoa πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 207 KB πŸ‘ 1 views

## Abstract We show that every 1‐tough graph __G__ on __n__ β‰₯ 3 vertices with Οƒ~3~≧ __n__ has a cycle of length at least min{__n, n__ + (Οƒ~3~/3 ) βˆ’ Ξ± + 1}, where Οƒ~3~ denotes the minimum value of the degree sum of any 3 pairwise nonadjacent vertices and Ξ± the cardinality of a miximum independent se

An Exponential Lower Bound for the Size
An Exponential Lower Bound for the Size of Monotone Real Circuits
✍ Armin Haken; Stephen A. Cook πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 118 KB

We prove a lower bound, exponential in the eighth root of the input length, on the size of monotone arithmetic circuits that solve an NP problem related to clique detection. The result is more general than the famous lower bound of Razborov and Andreev, because the gates of the circuit are allowed t