Adam Krawczyk

Learn More
In [4] Papadimitriou proposed to study the complexity of search problems for total functions, in which the existence of a solution is guaranteed via simple combinatorial arguments, but no efficient algorithmic solutions are known. See also [3, 5, 1] for other related works. One of the problems considered in [4] is the following: given a cubic graph G, and a(More)
The Lebesgue measurability and the property of Baire have traditionally been central problems of classical descriptive set theory. LUZIN proved that all continuous images of Bore1 sets (all analytic, or Zi sets) and their complements (coanalytic, or sets) are measurable. GODEL proved that neither the measurability nor the property of Baire for all A : sets(More)
  • 1