Igor Carboni Oliveira
Igor Carboni Oliveira
Bestätigte E-Mail-Adresse bei dcs.warwick.ac.uk - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Conspiracies between learning algorithms, circuit lower bounds and pseudorandomness
IC Oliveira, R Santhanam
Computational Complexity Conference (CCC), 2017
412017
Learning circuits with few negations
E Blais, C Canonne, IC Oliveira, R Servedio, LY Tan
International Workshop on Randomization and Computation (RANDOM), 2015
302015
The Power of Negations in Cryptography
S Guo, IC Oliveira, T Malkin, A Rosen
Theory of Cryptography Conference (TCC), 2015
282015
Algorithms versus circuit lower bounds
IC Oliveira
Electronic Colloquium on Computational Complexity (ECCC) - TR13-117, 2013
282013
Hardness Magnification for Natural Problems
IC Oliveira, R Santhanam
Symposium on Foundations of Computer Science (FOCS), 2018
262018
Constructing hard functions from learning algorithms
A Klivans, P Kothari, IC Oliveira
Conference on Computational Complexity (CCC), 2013
26*2013
Hardness magnification near state-of-the-art lower bounds
IC Oliveira, J Pich, R Santhanam
Computational Complexity Conference (CCC), 2019
202019
Pseudodeterministic constructions in subexponential time
IC Oliveira, R Santhanam
Symposium on Theory of Computing (STOC), 2017
202017
Near-optimal small-depth lower bounds for small-distance connectivity
X Chen, IC Oliveira, R Servedio, LY Tan
Symposium on Theory of Computing (STOC), 2016
172016
NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD circuits
S Hirahara, IC Oliveira, R Santhanam
Computational Complexity Conference (CCC), 2018
152018
Erdos-Ko-Rado in random hypergraphs: asymptotics and stability
MM Gauy, H Han, IC Oliveira
Combinatorics, Probability and Computing (CPC) 26 (3), 406-422, 2017
142017
Unconditional lower bounds in complexity theory
IC Oliveira
Columbia University (PhD Thesis), 2015
11*2015
Randomness and intractability in Kolmogorov complexity
IC Oliveira
International Colloquium on Automata, Languages and Programming (ICALP), 2019
102019
Majority is incompressible by AC^0[p] circuits
IC Oliveira, R Santhanam
Conference on Computational Complexity (CCC), 2015
102015
Pseudo-derandomizing learning and approximation
IC Oliveira, R Santhanam
International Conference on Randomization and Computation (RANDOM), 2018
92018
Addition is exponentially harder than counting for shallow monotone circuits
X Chen, IC Oliveira, R Servedio
Symposium on the Theory of Computing (STOC), 2017
92017
NP-hardness of circuit minimization for multi-output functions
R Ilango, B Loff, IC Oliveira
Computational Complexity Conference (CCC), 2020
82020
Beyond natural proofs: hardness magnification and locality
L Chen, S Hirahara, IC Oliveira, J Pich, N Rajgopal, R Santhanam
Innovations in Theoretical Computer Science (ITCS), 2020
72020
An average-case lower bound against ACC
R Chen, IC Oliveira, R Santhanam
Latin American Symposium on Theoretical Informatics (LATIN), 2018
7*2018
On monotone circuits with local oracles and clique lower bounds
J Krajicek, IC Oliveira
Chicago Journal of Theoretical Computer Science (CJTCS), 2018
72018
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20