The log-rank conjecture and low degree polynomials
type: Item
instance of: scholarly article
title: The log-rank conjecture and low degree polynomials
zbMATH Open document ID: 1183.68301
author: Paul Valiant
published in: Information Processing Letters
publication date: 2009-07-09T00:00:00Z
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5576927
zbMATH Keywords: log-rank conjecture
zbMATH Keywords: communication complexity
zbMATH Keywords: Boolean polynomials
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.ipl.2003.09.020
OpenAlex ID: W2046290908
Wikidata QID: Q123197977
cites work: The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear
cites work: Q4035673
DOI: 10.1016/J.IPL.2003.09.020
Recommended article: Around the log-rank conjecture
Recommended article: En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations
Recommended article: LOG-CONCAVITY AND ZEROS OF THE ALEXANDER POLYNOMIAL
Recommended article: Logarithmic concavity of Schur and related polynomials
Recommended article: The rank conjecture for number fields
Recommended article: A polynomial version of Sarnak's conjecture
Recommended article: Monodromy conjecture for log generic polynomials
Recommended article: Log-concavity and related properties of the cycle index polynomials
Recommended article: An analogue of Ruzsa's conjecture for polynomials over finite fields
Recommended article: Log-concave polynomials in theory and applications (tutorial)
description: scientific article; zbMATH DE number 5576927