A note on separating the relativized polynomial time hierarchy by immune sets
Ker-I Ko (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “The local catenativity of DOL-sequences in free commutative monoids is decidable in the binary case”
A note on separating the relativized polynomial time hierarchy by immune sets
Reducibilities on tally and sparse sets
Shouwen Tang, Ronald V. Book (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Bounded queries to arbitrary sets
A. Lozano (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On sets bounded truth-table reducible to -selective sets
Thomas Thierauf, Seinosuke Toda, Osamu Watanabe (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On searching for roots of a polynomial in a circular annulus
Ph. Saux Picart (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On finitely generated monoids of matrices with entries in
Andreas Weber, Helmut Seidl (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Existence of Polynomial Solutions of a Class of Riccati-Type Differential Equations.
H. Kaufman, Mira Bhargava (1965)
Collectanea Mathematica
Similarity:
A general theorem on triangular finite -elements
Alexander Ženíšek (1974)
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
Similarity: