Marco Carmosino

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 15

Top Topics

Boolean Functions

Boosted Decision Trees

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta
On the Number of Quantifiers Needed to Define Boolean Functions. CoRR (2024)
Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta
On the Number of Quantifiers Needed to Define Boolean Functions. MFCS (2024)
Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta, R. Ryan Williams
Parallel Play Saves Quantifiers. CoRR (2024)
MohammadMahdi Jahanara, Vahid R. Asadi, Marco Carmosino, Akbar Rafiey, Bahar Salamatian
Private Boosted Decision Trees via Smooth Re-Weighting. J. Priv. Confidentiality 13 (1) (2023)
Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta
A Finer Analysis of Multi-Structural Games and Beyond. CoRR (2023)
Eric Binnendyk, Marco Carmosino, Antonina Kolokolova, R. Ramyaa, Manuel Sabin
Learning with Distributional Inverters. ALT (2022)
Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor Carboni Oliveira
LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic. FOCS (2022)
Wei Zheng Teo, Marco Carmosino, Lior Horesh
Creating quantum-resistant classical-classical OWFs from quantum-classical OWFs. CoRR (2022)
Marco Carmosino, Kenneth Hoover, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova
Lifting for Constant-Depth Circuits and Applications to MCSP. ICALP (2021)
Eric Binnendyk, Marco Carmosino, Antonina Kolokolova, Ramyaa Ramyaa, Manuel Sabin
Learning with distributional inverters. CoRR (2021)
Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor Carboni Oliveira
LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic. FOCS (2021)
Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor Carboni Oliveira
LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic. Electron. Colloquium Comput. Complex. 28 (2021)
Marco Carmosino, Mia Minnes
Adaptive Rubrics. SIGCSE (2020)
Marco Carmosino, Russell Impagliazzo, Shachar Lovett, Ivan Mihajlin
Hardness Amplification for Non-Commutative Arithmetic Circuits. Electron. Colloquium Comput. Complex. 25 (2018)
Marco Carmosino, Russell Impagliazzo, Manuel Sabin
Fine-Grained Derandomization: From Problem-Centric to Resource-Centric Complexity. Electron. Colloquium Comput. Complex. 25 (2018)
Marco Carmosino, Jiawei Gao, Russell Impagliazzo, Ivan Mihajlin, Ramamohan Paturi, Stefan Schneider
Nondeterministic extensions of the Strong Exponential Time Hypothesis and consequences for non-reducibility. Electron. Colloquium Comput. Complex. 22 (2015)
Marco Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova
Tighter Connections between Derandomization and Circuit Lower Bounds. APPROX-RANDOM (2015)
Marco Carmosino, Neil Immerman, Charles Jordan
Experimental Descriptive Complexity. Logic and Program Semantics (2012)