Igor C. Oliveira

From MaRDI portal
Person:2125079

Available identifiers

zbMath Open oliveira.igor-carboniMaRDI QIDQ2125079

List of research outcomes





PublicationDate of PublicationType
Constant-depth circuits vs. monotone circuits2024-11-19Paper
Probabilistic Kolmogorov complexity with applications to average-case complexity2024-07-05Paper
Optimal coding theorems in time-bounded Kolmogorov complexity2024-06-24Paper
A duality between one-way functions and average-case symmetry of information2024-05-08Paper
Unprovability of strong complexity lower bounds in bounded arithmetic2024-05-08Paper
Pseudodeterministic algorithms and the structure of probabilistic time2023-11-14Paper
https://portal.mardi4nfdi.de/entity/Q61610542023-06-26Paper
Beyond Natural Proofs: Hardness Magnification and Locality2023-04-27Paper
https://portal.mardi4nfdi.de/entity/Q58757772023-02-03Paper
Hardness magnification near state-of-the-art lower bounds2022-07-27Paper
Parity helps to compute majority2022-07-27Paper
Randomness and Intractability in Kolmogorov Complexity2022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50924722022-07-21Paper
Algorithms and lower bounds for de morgan formulas of low-communication leaf gates2022-07-21Paper
Expander-based cryptography meets natural proofs2022-04-12Paper
Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates2022-03-29Paper
https://portal.mardi4nfdi.de/entity/Q50283642022-02-09Paper
https://portal.mardi4nfdi.de/entity/Q51218932020-09-22Paper
https://portal.mardi4nfdi.de/entity/Q51148302020-06-26Paper
https://portal.mardi4nfdi.de/entity/Q51111482020-05-26Paper
An average-case lower bound against \(\mathsf{ACC}^0\)2020-02-12Paper
Beyond Natural Proofs: Hardness Magnification and Locality2019-11-19Paper
Consistency of circuit lower bounds with bounded theories2019-05-30Paper
On monotone circuits with local oracles and clique lower bounds2018-08-08Paper
30th Conference on Computational Complexity (CCC 2015)2018-01-24Paper
Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability2017-10-10Paper
Near-optimal small-depth lower bounds for small distance connectivity2017-09-29Paper
Learning circuits with few negations2017-08-31Paper
Pseudodeterministic constructions in subexponential time2017-08-17Paper
Addition is exponentially harder than counting for shallow monotone circuits2017-08-17Paper
Unprovability of circuit upper bounds in Cook's theory PV2017-05-08Paper
An algebraic formulation of the graph reconstruction conjecture2016-04-15Paper
The Power of Negations in Cryptography2015-07-06Paper
Erratum to ``The Ricean objection: An analogue of Rice's theorem for first-order theories.2009-12-18Paper
The Ricean Objection: An Analogue of Rice's Theorem for First-order Theories2009-01-21Paper

Research outcomes over time

This page was built for person: Igor C. Oliveira