activity
20202025
most citedQuantifying Membership Inference Vulnerability via Generalization Gap and Other Model Metrics

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

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2020

Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism

Daniel Gibney, Gary Hoppenworth, Sharma V. Thankachan

The CNF formula satisfiability problem (CNF-SAT) has been reduced to many fundamental problems in P to prove tight lower bounds under the Strong Exponential Time Hypothesis (SETH).…