معرفی
Petar Marković is a full professor at the University of Novi Sad, Faculty of Sciences, Department of Mathematics and Informatics. His research focuses on universal algebra, constraint satisfaction problems, algebraic logic, and combinatorics. He holds a Ph.D. and has been actively publishing since at least 2000, with notable contributions to Mal’cev conditions, semigroup theory, and finite basis problems in algebra.
His academic career includes roles such as chair of the Applied Algebra department and membership in research groups studying algebraic structures and computational complexity. Marković’s work bridges theoretical computer science and mathematics, with applications in logic, graph theory, and computational problems. His personal website at http://people.dmi.uns.ac.rs/~markovicp/ provides further details on his research and publications.
Key areas of exploration include the structure of algebraic varieties, congruence properties, and the algebraic approach to constraint satisfaction problems (CSP). He has investigated the computational complexity of CSPs on specific graph classes and contributed to understanding the boundaries between tractable and intractable cases through algebraic methods.
