◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Widad Machmouchi

5 papers hereh-index 7116 citations13 works total

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

author position
  • sole author1
  • middle author1
  • last author3

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

fields
  • cs.CC4
  • cs.IR1

identity via Semantic Scholar / OpenAlex

activity
20102019
most citedThe Quantum Query Complexity of AC0

5 citations · 5 across the 5 of their papers we have counts for

collaborators
Showing 2010Show all

2 papers · 1 filter

cs.CC2010

Local-Testability and Self-Correctability of q-ary Sparse Linear Codes

Widad Machmouchi

We prove that q-ary sparse codes with small bias are self-correctable and locally testable. We generalize a result of Kaufman and Sudan that proves the local testability and correc…

cs.CC2010★ 5 cited

The Quantum Query Complexity of AC0

Paul Beame, Widad Machmouchi

We show that any quantum algorithm deciding whether an input function f from [n] to [n] is 2-to-1 or almost 2-to-1 requires Θ(n) queries to f. The same lower bound holds…

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