In this paper we determine the minimal number of yes-no queries needed to find an unknown integer between 1 and 1000000 if at most four of the answers may be erroneous
We present the derivation of a solution to a LISP programming exercise. The derivation is in three s...
AbstractCoalgebras of set functors preserving weak pullbacks are particularly well-behaved. Invoking...
The problem of the coefficient stability for operator‐ difference schemes with variable operator is ...
A multipartite tournament is an orientation of a complete multipartite graph. Simple derivations are...
A shooting method for two-point-boundary value problems for fully implicit index-1 and -2 differenti...
We present a non-looping method to construct Kripke trees refuting the non-theorems of intuitionisti...
In this paper, the concept of Abramov’s method for transferring boundary conditions posed for regula...
In this paper we give sharp explicit estimates for the difference of the Weil height and the Néron -...
We study continuous maps of the unit interval into itself. We determine necessary and suffcient cond...
In a dialogue procedure the decision maker has to determine in each step the aspiration and reservat...
AbstractLet Q be a Girard quantale. In other words Q is a complete lattice which also has the struct...
Convergence of fixed point sets of multivalued nonexpansive mappings is studied under both the Mosco...
Our aim is to show that in the worst case setting the integration problem is intractable. The implic...
This paper deals with pathfollowing methods in nonlinear optimization. We study the so- called "stan...
Differential algebraic equations consisting of a constant coefficient linear part and a small nonlin...
We present the derivation of a solution to a LISP programming exercise. The derivation is in three s...
AbstractCoalgebras of set functors preserving weak pullbacks are particularly well-behaved. Invoking...
The problem of the coefficient stability for operator‐ difference schemes with variable operator is ...
A multipartite tournament is an orientation of a complete multipartite graph. Simple derivations are...
A shooting method for two-point-boundary value problems for fully implicit index-1 and -2 differenti...
We present a non-looping method to construct Kripke trees refuting the non-theorems of intuitionisti...
In this paper, the concept of Abramov’s method for transferring boundary conditions posed for regula...
In this paper we give sharp explicit estimates for the difference of the Weil height and the Néron -...
We study continuous maps of the unit interval into itself. We determine necessary and suffcient cond...
In a dialogue procedure the decision maker has to determine in each step the aspiration and reservat...
AbstractLet Q be a Girard quantale. In other words Q is a complete lattice which also has the struct...
Convergence of fixed point sets of multivalued nonexpansive mappings is studied under both the Mosco...
Our aim is to show that in the worst case setting the integration problem is intractable. The implic...
This paper deals with pathfollowing methods in nonlinear optimization. We study the so- called "stan...
Differential algebraic equations consisting of a constant coefficient linear part and a small nonlin...
We present the derivation of a solution to a LISP programming exercise. The derivation is in three s...
AbstractCoalgebras of set functors preserving weak pullbacks are particularly well-behaved. Invoking...
The problem of the coefficient stability for operator‐ difference schemes with variable operator is ...
DOI
Add to ORKG