◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Carlos Palazuelos

3 papers here

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

author position
  • first author2
  • middle author1

Across the 3 of 3 papers where every author was matched, so the position is known.

fields
  • cs.CC1
  • math-ph1
  • quant-ph1
ORCID 0000-0002-3218-855X

identity via Semantic Scholar / OpenAlex

most citedConnes' embedding problem and Tsirelson's problem

186 citations · 187 across the 3 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2010★ 1 cited

The communication complexity of XOR games via summing operators

C. Palazuelos, D. Perez-Garcia, I. Villanueva

The discrepancy method is widely used to find lower bounds for communication complexity of XOR games. It is well known that these bounds can be far from optimal. In this context Di…

◍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.