◍wovepaper
SearchResearchersInstitutions
Sign in
institution

Stanford Medicine

United States

3 papers here4 citations across 3
fields
  • hep-ph1
  • math.AG1
  • quant-ph1
ROR 03mtd9a03OpenAlex

affiliations via OpenAlex

most citedComparing EQP and MOD_{p^k}P using Polynomial Degree Lower Bounds

4 citations

researchers with a paper here
  • A. Pierce1
  • Diane Maclagan1
  • Jay Wacker Yale1
  • Mart de Graaf1
  • Maurizio Piai1
  • Paul Valiant1
  • Rekha R. Thomas1
collaborating institutions
  • Centrum Wiskunde & InformaticaNL1 paper
  • Stanford UniversityUS1 paper
Showing quant-phShow all

1 paper · 1 filter

quant-ph2002★ 4 cited

Comparing EQP and MOD_{p^k}P using Polynomial Degree Lower Bounds

M. de Graaf, P. Valiant

We show that an oracle A that contains either 1/4 or 3/4 of all strings of length n can be used to separate EQP from the counting classes MOD_{p^k}P. Our proof makes use of the deg…

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