- 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.

- Marek Kosta
- 2016

Quantifier elimination methods for real closed fields are an intensively studied subject from both theoretical and practical points of view. This thesis studies quantifier elimination based on… (More)

- Russell J. Bradford, James H. Davenport, +8 authors Andreas Weber
- ISSAC
- 2017

We consider the problem of determining multiple steady states for positive real values in models of biological networks. Investigating the potential for these in models of the mitogen-activated… (More)

- Christopher W. Brown, Marek Kosta
- J. Symb. Comput.
- 2015

This paper presents an algorithm which, given a point and a set of polynomials, constructs a single cylindrical cell containing the point, such that the given polynomials are sign-invariant in the… (More)

- Marek Kosta, Thomas Sturm, Andreas Dolzmann
- SMT
- 2014

We consider existential problems over the reals. Extended quantifier elimination generalizes the concept of regular quantifier elimination by providing in addition answers, which are descriptions of… (More)

- Konstantin Korovin, Marek Kosta, Thomas Sturm
- SMT
- 2014

We consider satisfiability modulo theory-solving for linear real arithmetic. Inspired by related work for the Fourier–Motzkin method, we combine virtual substitution with learning strategies. For the… (More)

Abstract The health benefits of polyunsaturated fatty acids are well known, however their fragility is a drawback as it leads to their degradation. The objective of this study was to develop… (More)

- Pavol Duris, Marek Kosta
- ITAT
- 2011

Flip-pushdown automaton is pushdown automaton which has ability to flip its pushdown throughout the computation. This model was introduced in [3] by Sarkar. Here we solve in the affirmative the… (More)

- Marek Kosta, Thomas Sturm
- ArXiv
- 2015

We generalize the framework of virtual substitution for real quantifier elimination to arbitrary but bounded degrees. We make explicit the representation of test points in elimination sets using… (More)

- Pavol Duris, Marek Kosta
- Electronic Colloquium on Computational Complexity
- 2011

We prove that any propagating E0L system cannot generate the language {w#w|w∈{0,1}⁎}. This result, together with some known ones, enables us to conclude that the flip-pushdown automata with k… (More)

- Ďurǐs, Marek Kosta
- 2011

We prove that any propagating E0L system cannot generate the language {w#w|w ∈ {0, 1}∗}. This result, together with some known ones, enable us to conclude that the flip-pushdown automata with k… (More)