Explicit exponential lower bounds for exact hyperplane covers

被引：1

作者：

Diamond, Benjamin E. ^{[1
]}

Yehudayoff, Amir ^{[2
]}

机构：

[1] Coinbase, Appl Cryptog, Santa Monica, CA 90401 USA

[2] Technion IIT, Dept Math, Haifa, Israel

来源：

DISCRETE MATHEMATICS | 2022年 / 345卷 / 11期

基金：

美国国家科学基金会;

关键词：

Exact hyperplane covers; Communication complexity; Lower bounds; LITTLEWOOD; OFFORD;

D O I：

10.1016/j.disc.2022.113114

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We describe an explicit and simple subset of the discrete hypercube which cannot be exactly covered by fewer than exponentially many hyperplanes. The proof exploits a connection to communication complexity, and relies heavily on Razborov's lower bound for disjointness.(c) 2022 Elsevier B.V. All rights reserved.

引用

页数：7

共 50 条

[31] Explicit lower bounds for ∥(3/2)k∥
Habsieger, L
ACTA ARITHMETICA, 2003, 106 (03) : 299 - 309
[32] Explicit Lower Bounds on Strong Quantum Simulation
Huang, Cupjin
Newman, Michael
Szegedy, Mario
IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (09) : 5585 - 5600
[33] Exponential Lower Bounds and Separation for Query Rewriting
Kikot, Stanislav
Kontchakov, Roman
Podolskii, Vladimir
Zakharyaschev, Michael
AUTOMATA, LANGUAGES, AND PROGRAMMING, ICALP 2012, PT II, 2012, 7392 : 263 - 274
[34] Exponential Lower Bounds for Polytopes in Combinatorial Optimization
Fiorini, Samuel
Massar, Serge
Pokutta, Sebastian
Tiwary, Hans Raj
De Wolf, Ronald
JOURNAL OF THE ACM, 2015, 62 (02)
[35] EXPONENTIAL LOWER BOUNDS ON A CLASS OF KNAPSACK ALGORITHMS
HAUSMANN, D
KANNAN, R
KORTE, B
MATHEMATICS OF OPERATIONS RESEARCH, 1981, 6 (02) : 225 - 232
[36] Strongly Exponential Lower Bounds for Monotone Computation
Pitassi, Toniann
Robere, Robert
STOC'17: PROCEEDINGS OF THE 49TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2017, : 1246 - 1255
[37] Exponential Lower Bounds for Monotone Span Programs
Robere, Robert
Pitassi, Toniann
Rossman, Benjamin
Cook, Stephen A.
2016 IEEE 57TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2016, : 406 - 415
[38] LOWER BOUNDS BASED ON THE EXPONENTIAL TIME HYPOTHESIS
Arvind, V.
Lokshtanov, Daniel
Marx, Daniel
Saurabh, Saket
BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2011, (105): : 41 - 71
[39] EXPLICIT AND EXPONENTIAL BOUNDS FOR A TEST ON THE COEFFICIENT OF AN AR(1) MODEL
BRUNO, MB
VIANO, MC
STATISTICS & PROBABILITY LETTERS, 1995, 25 (04) : 365 - 371
[40] Explicit bounds on exponential sums and the scarcity of squarefree binomial coefficients
Granville, A
Ramare, O
MATHEMATIKA, 1996, 43 (85) : 73 - 107

← 1 2 3 4 5 →