◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Matthew W. Anderson

5 papers hereh-index 7166 citations14 works total

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

author position
  • first author5

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

fields
  • cs.CC4
  • cs.LO1

identity via Semantic Scholar / OpenAlex

activity
20132023
most citedEfficiently-Verifiable Strong Uniquely Solvable Puzzles and Matrix Multiplication

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

collaborators
Showing 2015Show all

1 paper · 1 filter

cs.CC2015★ 1 cited

Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs

Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi +2

Read-k oblivious algebraic branching programs are a natural generalization of the well-studied model of read-once oblivious algebraic branching program (ROABPs). In this work, we…

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