Search filters

List of works by Dan Gutfreund

An autonomous debating system

scientific article published on 17 March 2021

If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances

article by Dan Gutfreund et al published December 2007 in Computational Complexity

Moments in Time Dataset: One Million Videos for Event Understanding

scientific article published on 25 February 2019

ObjectNet: A large-scale bias-controlled dataset for pushing the limits of object recognition models ⬇️

article by Andrei Barbu et al published 2019 in Advances in Neural Information Processing Systems 32

Succinct Permanent Is NEXP-Hard with Many Hard Instances

article by Shlomi Dolev et al published 2013 in Lecture Notes in Computer Science

Uniform hardness versus randomness tradeoffs for Arthur-Merlin games

Worst-Case to Average-Case Reductions Revisited

Paulina is supported by:

About Paulina

Help