Logowanie

Języki

  • Polski
  • English
fotopracownik

Nawigacja

prof. Leszek Pacholski

Pracownik  

2010

  1. W. Charatonik, L. Pacholski, Set constraints with projections, Journal of the ACM, 57(4), 1-37, 2010.

2004

  1. L. Pacholski, Pierwszy problem milenijny – czy NP=P?, Wiadomości Matematyczne.

2003

  1. J. Marcinkowski, L. Pacholski, Thue trees, Annals of Pure and Applied Logic, vol. 119, issue 1-3 (2003), pp 19-59.

2001

  1. L. Pacholski, SOFSEM 2001: Theory and Practice of Informatics, Proceedings of 28th Conference on Current Trends in Theory and Practice of Informatics, Lecture Notes in Computer Science tom 2234, (editor).

2000

  1. L. Pacholski, W. Szwast, L. Tendera, Complexity Results for Two-Variable Logic with Counting, SIAM J. on Computing, 29 (2000), pp. 1083-1117.
  2. L. Pacholski, In memoriam: Jerzy Łoś, The Bulletin of Symbolic Logic, 6 (2000), pp. 97-100.

1999

  1. P. Krysta, L. Pacholski, The STO problem is NP-complete, Journal of Symbolic Computation 27(2), February 1999, pp. 207-219.
  2. M. Kutyłowski, L. Pacholski, Mathematical Foundations of Computer Science 1999 (red. T. Wierzbicki), Lecture Notes in Computer Science, volume 1672, Springer-Verlag, Berlin 1999.

1998

  1. A. Kościelski, L. Pacholski, Makanins group algorithm is not primitive recursive, Theoretical Computer Science 191 (1998), 145-156.
  2. P. Mielniczuk, L. Pacholski, Tarskian set constraints are in NEXPTIME, Proceedings of 23rd Symposium na Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 1450, Springer, Berlin 1998, 589-596.

1997

  1. L. Pacholski, A. Podelski, Set constraints: a pearl in research on constraints, Proceedings of 3rd Conference on Principles and Practice of Constraint Programming, CP973, Lecture Notes in Computer Science 1330, Springer, Berlin 1997, 549-561.
  2. L. Pacholski, W. Szwast, L. Tendera, Complexity of two-variable logic with counting, Proceedings of 12th IEEE Symposium on Logic in Computer Science, Los Alamitos 1997, 318-327.

1996

  1. A. Kościelski, L. Pacholski, Complexity of Makanin's algorithm, Journal of the Association for Computing Machinery, 43 (1996), 670-684.

1994

  1. W. Charatonik, L. Pacholski, Negative set constraints with equality, Proc. 9th IEEE Symposium on Logic in Computer Science (LICS), Paris 1994, 128-136.
  2. W. Charatonik, L. Pacholski, Set constraints with projections are in NEXPTIME, Proc. 35th Symposium on Foundations of Computer Science (FOCS), Santa Fe 1994, 642-653.

1993

  1. L. Pacholski, Undecidability of implication problems in logic programming, database theory and classical logic (red. G. Gottlob, A. Leitsch, D. Mundici), Computational Logic and Proof Theory, Proceedings of the Third Kurt Gódel Colloquium, KGC'93, Lecture Notes in Computer Science, vol. 713, Springer-Verlag, Berlin 1993, 63-68.
  2. W. Charatonik, L. Pacholski, Word Equations with Two Variables, Proceedings of 2nd Workshop on Word Equations and Related Topics, IWWERT'91, Lecture Notes in Computer Science, vol. 677, Springer-Verlag, Berlin 1993, 43-56.
  3. L. Pacholski, W. Szwast, A counterexample to the 0-1 law for existential second order minimal Gódel sentences, Information and Computation 107 (1993), 91-103.

Adres:
Instytut Informatyki
Uniwersytetu Wroclawskiego
ul. Joliot-Curie 15
50-383 Wroclaw
Sekretariat
tel.: 71 375 7800
tel.: 71 325 1271
fax: 71 375 7801
sekretariat@ii.uni.wroc.pl
Dziekanat
tel.: 71 375 7892
dziekan@ii.uni.wroc.pl
sprawy studenckie:
dziekanat@ii.uni.wroc.pl
Portiernia
tel.: 71 375 7958
Redaktor strony WWW
redaktor@ii.uni.wroc.pl
Projekt
MAKOS