DeepAI

AI Chat AI Image Generator AI Video AI Music Generator

An improvement of the upper bound for GKS communication game

01/12/2020

∙

by Ivan Petrenko, et al.

∙

∙

The GKS game was formulated by Justin Gilmer, Michal Koucky, and Michael Saks in their research of the sensitivity conjecture. Mario Szegedy invented a protocol for the game with the cost of O(n^0.4732). Then a protocol with the cost of O(n^0.4696) was obtained by DeVon Ingram who used a bipartite matching. We propose a slight improvement of Ingram's method and design a protocol with cost of O(n^0.4693).

page 1

page 2

page 3

page 4

research

∙ 12/04/2017

An Upper Bound on the GKS Game via Max Bipartite Matching

The sensitivity conjecture is a longstanding conjecture concerning the r...

0 DeVon Ingram, et al. ∙

research

∙ 06/22/2015

An O(n^0.4732) upper bound on the complexity of the GKS communication game

We give an 5· n^_305 upper bund on the complexity of the communication g...

0 Mario Szegedy, et al. ∙

research

∙ 01/28/2021

An Upper Bound on the Complexity of Tablut

Tablut is a complete-knowledge, deterministic, and asymmetric board game...

0 Andrea Galassi, et al. ∙

research

∙ 12/14/2018

Utility Ghost: Gamified redistricting with partisan symmetry

Inspired by the word game Ghost, we propose a new protocol for bipartisa...

0 Dustin G. Mixon, et al. ∙

research

∙ 01/07/2022

Most Clicks Problem in Lights Out

Consider a game played on a simple graph G = (V, E) where each vertex co...

0 William Boyles, et al. ∙

research

∙ 09/12/2019

A refined determinantal inequality for correlation matrices

Olkin [3] obtained a neat upper bound for the determinant of a correlati...

0 Niushan Gao, et al. ∙

research

∙ 09/07/2017

Automated Dyadic Data Recorder (ADDR) Framework and Analysis of Facial Cues in Deceptive Communication

We developed an online framework that can automatically pair two crowd-s...

0 Tayan Sen, et al. ∙