◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Alexander A. Sherstov

1 paper here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • cs.CC1
ORCID 0000-0002-2488-7852

identity via Semantic Scholar / OpenAlex

most citedCommunication Lower Bounds Using Dual Polynomials

55 citations · 55 across the 1 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2008★ 55 cited

Communication Lower Bounds Using Dual Polynomials

Alexander A. Sherstov

Representations of Boolean functions by real polynomials play an important role in complexity theory. Typically, one is interested in the least degree of a polynomial p(x_1,...,x_n…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.