#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2014

2018

- This year (2)
- Last 5 years (10)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Joanna Ochremiak
- ICALP
- 2015

The paper presents an algebraic framework for optimization problems expressible as Valued Constraint Satisfaction Problems. Our results generalize the algebraic framework for the decision versionâ€¦ (More)

- Bartek Klin, Eryk Kopczynski, Joanna Ochremiak, Szymon Torunczyk
- 2015 30th Annual ACM/IEEE Symposium on Logic inâ€¦
- 2015

First-order definable structures with atoms are infinite, but exhibit enough symmetry to be effectively manipulated. We study Constraint Satisfaction Problems (CSPs) where both the instance and theâ€¦ (More)

- Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk
- CSL-LICS
- 2014

We study deterministic computability over sets with atoms. We characterize those alphabets for which Turing machines with atoms determinize. To this end, the determinization problem is expressed as aâ€¦ (More)

- Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk
- FSTTCS
- 2016

We investigate several variants of the homomorphism problem: given two relational structures, is there a homomorphism from one to the other? The input structures are possibly infinite, but definableâ€¦ (More)

- Joanna Ochremiak
- 2015

To solve an instance of the constraint satisfaction problem (CSP) one has to find an assignment of values to variables that satisfies given constraints. This thesis concerns two different extensionsâ€¦ (More)

- Albert Atserias, Joanna Ochremiak
- ICALP
- 2017

We analyse how the standard reductions between constraint satisfaction problems affect their proof complexity. We show that, for the most studied propositional, algebraic, and semi-algebraic proofâ€¦ (More)

We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Underâ€¦ (More)

- Albert Atserias, Joanna Ochremiak
- LICS
- 2018

The ellipsoid method is an algorithm that solves the (weak) feasibility and linear optimization problems for convex sets by making oracle calls to their (weak) separation problem. We observe that theâ€¦ (More)

- Joanna Ochremiak
- RAMICS
- 2014

Nominal sets, introduced to Computer Science by Gabbay and Pitts, are useful for modeling computation on data structures built of atoms that can only be compared for equality. In certain contexts itâ€¦ (More)

- Filip Mazowiecki, Joanna Ochremiak, Adam Witkowski
- MFCS
- 2015

We study the problem of eliminating recursion from monadic datalog programs on trees with an infinite set of labels. We show that the boundedness problem, i.e., determining whether a datalog programâ€¦ (More)

- â€¹
- 1
- â€º