- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications (all current information on this profile has been aggregated automatically from

**publisher and metadata sources**).We study the computational complexity of constraint satisfaction problems that are based on integer expressions and algebraic circuits. On input of a finite set of variables and a finite set of… Continue Reading

We study the computational complexity of emptiness problems for circuits over sets of natural numbers with the operations union, intersection, complement, addition, and multiplication. For most… Continue Reading

Consider the following conjectures:
- $\mathsf{DisjNP}$: there exist no many-one complete disjoint NP-pairs.
- $\mathsf{SAT}$: there exist no P-optimal proof systems for SAT.
Pudlak [Pud17] lists… Continue Reading

We investigate the computational complexity of balance problems for {−, ·}-circuits computing finite sets of natural numbers. These problems naturally build on problems for integer expressions and… Continue Reading

Abstract Pudlak [19] lists several major complexity theoretic conjectures relevant to proof complexity and asks for oracles that separate pairs of corresponding relativized conjectures. Among these… Continue Reading

Pudlak [Pud17] lists several major conjectures from the field of proof complexity and asks for oracles that separate corresponding relativized conjectures. Among these conjectures are:
-… Continue Reading

We build on a working program initiated by Pudlak [Pud17] and construct an oracle relative to which each set in $\mathrm{coNP}$ has $\mathrm{P}$-optimal proof systems and… Continue Reading

The carrying capacity is assumed to be constant in population growth models used for resource assessment and management. However, changes to the carrying capacity do occur due to both exogenic and… Continue Reading