Michal R. Przybylek

According to our database, Michal R. Przybylek authored at least 12 papers between 2011 and 2026.

Collaborative distances:

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

2026

Information-Based Complexity vs Computational Complexity in Phaseless Polynomial Interpolation.

Michal R. Przybylek, Pawel Siedlecki

CoRR, March, 2026

2023

A note on encoding infinity in ZFA with applications to register automata.

Michal R. Przybylek

CoRR, 2023

2020

A note on the complexity of a phaseless polynomial interpolation.

Michal R. Przybylek, Pawel Siedlecki

J. Complex., 2020

On amenability of constraint satisfaction problems.

Michal R. Przybylek

CoRR, 2020

Beyond sets with atoms: definability in first order logic.

Michal R. Przybylek

CoRR, 2020

2018

Decomposition Algorithms for a Multi-Hard Problem.

Michal R. Przybylek, Adam Wierzbicki, Zbigniew Michalewicz

Evol. Comput., 2018

2017

Process Mining Methods for Post-Delivery Validation.

Pawel Markowski, Michal R. Przybylek

Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, 2017

2016

Multi-hard Problems in Uncertain Environment.

Michal Roman Przybylek, Adam Wierzbicki, Zbigniew Michalewicz

Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

Process Mining Methodology in Industrial Environment: Document Flow Analysis.

Pawel Markowski, Michal R. Przybylek

Proceedings of the 2016 Federated Conference on Computer Science and Information Systems, 2016

2014

Socially inspired algorithms for the travelling thief problem.

Mohammad Reza Bonyadi, Zbigniew Michalewicz, Michal Roman Przybylek, Adam Wierzbicki

Proceedings of the Genetic and Evolutionary Computation Conference, 2014

2013

Process Mining through Tree Automata.

Michal R. Przybylek

Proceedings of the IJCCI 2013, 2013

2011

Skeletal Algorithms.

Michal R. Przybylek

Proceedings of the ECTA and FCTA 2011, 2011