Skip to main content

Web Content Display Web Content Display

Most significant publications

  • Paweł Idziak, Jacek Krzaczkowski, Satisfiability in multi-valued circuits, SIAM Journal on Computing 51(3) (2022), 337-378
  • Paweł Idziak, Petar Marković, Ralph McKenzie, Matthew Valeriote, Ross Willard, Tractability and learnabilty arising from algebras with few subpowers, SIAM Journal on Computing 39 (2010), 3023-3037
  • Paweł Idziak, Ralph McKenzie, Matthew Valeriote, The structure of locally finite varieties with polynomially many models, Journal of the American Mathematical Society 22 (2009), 119-165
  • Joel Berman, Paweł Idziak, Generative Complexity in Algebra, Memoirs of the American Mathematical Society 175 (2005), 1-168
  • Paweł Idziak, A Characterization of Finitely Decidable Congruence Modular Varieties, Transactions of the American Mathematical Society 349 (1997), 903-934

Recent publications

  • Paweł Idziak, Piotr Kawałek, Jacek Krzaczkowski, Armin Weiss, Equation satisfiability in solvable groups, Theory of Computing Systems (2022),
  • Paweł Idziak, Jacek Krzaczkowski, Satisfiability in multi-valued circuits, SIAM Journal on Computing 51(3) (2022), 337-378
  • Paweł Idziak, Piotr Kawałek, Jacek Krzaczkowski, Complexity of Modular Circuits, IEEE Symposium on Logic in Computer Science [LICS] LICS'22; Proc. of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (2022),
  • Paweł Idziak, Piotr Kawałek, Jacek Krzaczkowski, Armin Weiss, Satisfiability problems for finite groups, International Colloquium on Automata Languages and Programming [ICALP](MAIN) ICALP'22; 49th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022), 127:1-127:20
  • Paweł Idziak, Piotr Kawałek, Jacek Krzaczkowski, Satisfiability of Circuits and Equations over Finite Malcev Algebras, International Symposium on Theoretical Aspects of Computer Science [STACS] STACS'22; Proc. of the 39th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022), 37:1-37:14

Interests

Algorithmics,

Computational complexity,

Algebra in computer science,

Logic in computer science,

avatar for Paweł Idziak

Paweł Idziak

academic degree/title Professor position
research and faculty staff member group, professor
unit
  • Algorithmics Research Group
  • Theoretical Computer Science
ORCID contact
pawel.idziak@uj.edu.pl
www