activity
20202026
most citedThe Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth

2 citations · 7 across the 9 of their papers we have counts for

collaborators
Showing 2022Show all

1 paper · 1 filter

cs.DS2022

On the cut-query complexity of approximating max-cut

Orestis Plevrakis, Seyoon Ragavan, S. Matthew Weinberg

We consider the problem of query-efficient global max-cut on a weighted undirected graph in the value oracle model examined by [RSW18]. Graph algorithms in this cut query model and…