UB Paderborn / Katalog / Suche / in CDI

Rewriting Techniques and Applications: 4th International Conference, RTA-91 Como, Italy, April 10–12, 1991 Proceedings

1991

Volltextzugriff (PDF)

On languages reducible to algorithmically random languages

SIAM journal on computing, 1994-12, Vol.23 (6), p.1275-1282

BOOK, R. V

1994

Volltextzugriff (PDF)

Thue systems as rewriting systems

Journal of symbolic computation, 1987-02, Vol.3 (1), p.39-68

Book, Ronald V.

1987

Volltextzugriff (PDF)

On collapsing the polynomial-time hierarchy

Information processing letters, 1994-12, Vol.52 (5), p.235-237

Book, Ronald V.

1994

Volltextzugriff (PDF)

On Random Hard Sets for NP

Information and computation, 1996-02, Vol.125 (1), p.70-76

1996

Volltextzugriff (PDF)

Some observations on separating complexity classes

SIAM journal on computing, 1991-04, Vol.20 (2), p.246-258

BOOK, R. V

1991

Volltextzugriff (PDF)

Polynomial-time reducibilities and “almost all” oracle sets

Theoretical computer science, 1991-04, Vol.81 (1), p.35-47

1991

Volltextzugriff (PDF)

Decidable sentences of Church-Rosser congruences

Theoretical computer science, 1983-01, Vol.24 (3), p.301-312

Book, Ronald V.

1983

Volltextzugriff (PDF)

Probabilistic Type-2 Operators and "Almost"-Classes

Computational complexity, 1998-01, Vol.7 (3), p.265-289

1998

Volltextzugriff (PDF)

On languages with very high space-bounded Kolmogorov complexity

SIAM journal on computing, 1993-04, Vol.22 (2), p.395-402

1993

Volltextzugriff (PDF)

The Global Power of Additional Queries to Random Oracles

Information and computation, 1995-07, Vol.120 (1), p.49-54

1995

Volltextzugriff (PDF)

Advances in Algorithms, Languages, and Complexity

1, 1997

Volltextzugriff (PDF)

On random oracle separations

Information processing letters, 1991-07, Vol.39 (1), p.7-10

Book, Ronald V.

1991

Volltextzugriff (PDF)

Quantitative relativizations of complexity classes

SIAM journal on computing, 1984-08, Vol.13 (3), p.461-487

1984

Volltextzugriff (PDF)

The polynomial-time hierarchy and sparse oracles

Journal of the ACM, 1986-07, Vol.33 (3), p.603-617

1986

Volltextzugriff (PDF)

On sets truth-table reducible to sparse sets

SIAM journal on computing, 1988-10, Vol.17 (5), p.903-919

1988

Volltextzugriff (PDF)

On “inherently context-sensitive” languages — An application of complexity cores

Information processing letters, 1991-10, Vol.40 (1), p.21-23

1991

Volltextzugriff (PDF)

Reductions in tree replacement systems

Theoretical computer science, 1985, Vol.37 (2), p.123-150

1985

Volltextzugriff (PDF)

Rewriting systems and word problems in a free partially commutative monoid

Information processing letters, 1987-09, Vol.26 (1), p.29-32

1987

Volltextzugriff (PDF)

A note on sparse sets and the polynomial-time hierarchy

Information processing letters, 1989-11, Vol.33 (3), p.141-143

1989

Volltextzugriff (PDF)

The existence and density of generalized complexity cores

Journal of the ACM, 1987-07, Vol.34 (3), p.718-730

1987

Volltextzugriff (PDF)

Homogeneous Thue systems and the Church-Rosser property

Discrete mathematics, 1984-01, Vol.48 (2), p.137-145

Book, Ronald V

1984

Volltextzugriff (PDF)

Sets with small generalized Kolmogorov complexity

Acta informatica, 1986-11, Vol.23 (6), p.679-688

1986

Volltextzugriff (PDF)

Characterizing polynomial complexity classes by reducibilities

Mathematical Systems Theory, 1990-12, Vol.23 (3), p.165-174

1990

Volltextzugriff (PDF)

On the security of name-stamp protocols

Theoretical computer science, 1985, Vol.39 (2-3), p.319-325

1985

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Rewriting Techniques and Applications: 4th International Conference, RTA-91 Como, Italy, April 10–12, 1991 Proceedings

On languages reducible to algorithmically random languages

Thue systems as rewriting systems

On collapsing the polynomial-time hierarchy

On Random Hard Sets for NP

Some observations on separating complexity classes

Polynomial-time reducibilities and “almost all” oracle sets

Decidable sentences of Church-Rosser congruences

Probabilistic Type-2 Operators and "Almost"-Classes

On languages with very high space-bounded Kolmogorov complexity

The Global Power of Additional Queries to Random Oracles

Advances in Algorithms, Languages, and Complexity

On random oracle separations

Quantitative relativizations of complexity classes

The polynomial-time hierarchy and sparse oracles

On sets truth-table reducible to sparse sets

On “inherently context-sensitive” languages — An application of complexity cores

Reductions in tree replacement systems

Rewriting systems and word problems in a free partially commutative monoid

A note on sparse sets and the polynomial-time hierarchy

The existence and density of generalized complexity cores

Homogeneous Thue systems and the Church-Rosser property

Sets with small generalized Kolmogorov complexity

Characterizing polynomial complexity classes by reducibilities

On the security of name-stamp protocols

Suchergebnisse filtern