Nicollas M. Sdroievski

According to our database, Nicollas M. Sdroievski authored at least 5 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2025

Instance-Wise Hardness and Refutation versus Derandomization for Arthur-Merlin Protocols.

Dieter van Melkebeek, Nicollas M. Sdroievski

Comput. Complex., December, 2025

2023

Leakage Resilience, Targeted Pseudorandom Generators, and Mild Derandomization of Arthur-Merlin Protocols.

Dieter van Melkebeek, Nicollas M. Sdroievski

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

Instance-Wise Hardness Versus Randomness Tradeoffs for Arthur-Merlin Protocols.

Dieter van Melkebeek, Nicollas M. Sdroievski

Proceedings of the 38th Computational Complexity Conference, 2023

2018

The Hidden Subgroup Problem and MKTP.

Nicollas M. Sdroievski, Murilo V. G. da Silva, André Luís Vignatti

Electron. Colloquium Comput. Complex., 2018

An Indexing for Quadratic Residues Modulo N and a Non-uniform Efficient Decoding Algorithm.

Nicollas M. Sdroievski, Murilo V. G. da Silva, André Luís Vignatti

CoRR, 2018