LCC
1994
14 years 3 months ago
1994
We firstly survey several forms of Herbrand's theorem. What is commonly called "Herbrand's theorem" in many textbooks is actually a very simple form of Herbrand...
LCC
1994
14 years 3 months ago
1994
We demonstrate program extraction by the Light Dialectica Interpretation (LDI) on a minimal logic proof of the classical existence of Fibonacci numbers. This semi-classical proof ...
ISAAC
1994
Springer
14 years 3 months ago
1994
Springer
In this paper we present efficient deterministic and randomized algorithms for selection on any interconnection network when the number of input keys (n) is the number of processo...
ISAAC
1994
Springer
14 years 3 months ago
1994
Springer
ISAAC
1994
Springer
14 years 3 months ago
1994
Springer
We present here an algorithm for detecting (and outputting, if exists) a negative cycle in an n-vertex planar digraph G with real
ISAAC
1994
Springer
14 years 3 months ago
1994
Springer
We describe a substring search problem that arises in group presentation simplification processes. We suggest a two-level searching model: skip and match levels. We give two timest...
ISAAC
1994
Springer
14 years 3 months ago
1994
Springer
ISAAC
1994
Springer
14 years 3 months ago
1994
Springer
ISAAC
1993
Springer
14 years 3 months ago
1993
Springer
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
ISAAC
1993
Springer
14 years 3 months ago
1993
Springer
