#### Filter Results:

#### Publication Year

1998

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We compare two commonly used diagnostic approaches, one relying on plasma bicarbonate concentration and "anion gap," the other on "base excess," with a third method based on physicochemical principles, for their value in detecting complex metabolic acid-base disturbances. We analyzed arterial blood samples from 152 patients and nine normal subjects for pH,… (More)

- V Špatenková, A Kazda, P Škrabálek
- 2003

We investigate the continuity of the ω-functions and real functions defined by weighted finite automata (WFA). We concentrate on the case of average preserving WFA. We show that every continuous ω-function definable by some WFA can be defined by an average preserving WFA and then characterize minimal average preserving WFA whose ω-function or ω-function and… (More)

We characterize absorption in finite idempotent algebras by means of Jónsson absorption and cube term blockers. As an application we show that it is decidable whether a given subset is an absorbing subuniverse of an algebra given by the tables of its basic operations.

The main result of this paper is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all constraints are even ∆-matroid relations (represented by lists of tuples). As a consequence of this, we… (More)

We show that if $\mathbb A$ is a core relational structure such that $CSP(\mathbb{A})$ can be solved by a linear Datalog program, and $\mathbb A$ is $n$-permutable for some $n$, then $CSP(\mathbb A)$ can be solved by a symmetric Datalog program (and thus $CSP(\mathbb{A})$ lies in deterministic logspace). At the moment, it is not known for which structures… (More)

We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and compute normal forms in each of these, and hence also to test whether any given identity holds in the classes of left,… (More)

We prove that if A is a large random relational structure (with at least one relation of arity at least 2) then the homomorphism extension problem EXT(A) is almost surely NP-complete.

- V Spatenkova, A Kazda, P Suchomel
- 2011