UB Paderborn / Katalog / Suche / in CDI

Detection of the benzodiazepine bromazolam by liquid chromatography with quadrupole time of flight mass spectrometry in postmortem toxicology casework and prevalence in Indiana (2023)

Journal of analytical toxicology, 2024-06

2024

Volltextzugriff (PDF)

Gap-definable counting classes

Journal of computer and system sciences, 1994, Vol.48 (1), p.116-148

1994

Volltextzugriff (PDF)

A Computer Scientist's Perspective on Chaos and Mystery

Zygon, 2002-06, Vol.37 (2), p.415-420

Kurtz, Stuart A.

2002

Volltextzugriff (PDF)

Lemonade from lemons: Harnessing device wearout to create limited-use security architectures

2017 ACM/IEEE 44th Annual International Symposium on Computer Architecture (ISCA), 2017, p.361-374

2017

Volltextzugriff (PDF)

Every polynomial-time 1-degree collapses if and only if P = PSPACE

The Journal of symbolic logic, 2004-09, Vol.69 (3), p.713-741

2004

Volltextzugriff (PDF)

The Isomorphism Conjecture Holds Relative to an Oracle

SIAM journal on computing, 1996-02, Vol.25 (1), p.193-206

1996

Volltextzugriff (PDF)

The isomorphism conjecture fails relative to a random oracle

Journal of the ACM, 1995-03, Vol.42 (2), p.401-420

1995

Volltextzugriff (PDF)

The Undecidability of the Generalized Collatz Problem

Theory and Applications of Models of Computation, p.542-553

Volltextzugriff (PDF)

An oracle builder’s toolkit

Information and computation, 2003-05, Vol.182 (2), p.95-136

2003

Volltextzugriff (PDF)

Sparse Sets in : Relativizations

SIAM journal on computing, 1985-02, Vol.14 (1), p.113-119

Kurtz, Stuart A.

1985

Volltextzugriff (PDF)

A note on randomized polynomial time

SIAM journal on computing, 1987-10, Vol.16 (5), p.852-853

KURTZ, S. A

1987

Volltextzugriff (PDF)

Lemonade from Lemons: Harnessing Device Wearout to Create Limited-Use Security Architectures

Computer architecture news, 2017-09, Vol.45 (2), p.361-374

2017

Volltextzugriff (PDF)

Notions of weak genericity

The Journal of symbolic logic, 1983-09, Vol.48 (3), p.764-770

Kurtz, Stuart A.

1983

Volltextzugriff (PDF)

On the random oracle hypothesis

Annual ACM Symposium on Theory of Computing: Proceedings of the fourteenth annual ACM symposium on Theory of computing; 05-07 May 1982, 1982, p.224-230

Kurtz, Stuart A.

1982

Volltextzugriff (PDF)

Comment on: ‘‘Letter to the Editor: Steep wave fronts on extrudates of polymer melts and solutions,’’ by D. D. Joseph and Y. Joe Liu

Journal of rheology (New York : 1978), 1996-03, Vol.40 (2), p.319-320

Kurtz, Stuart J.

1996

Volltextzugriff (PDF)

How to prove representation-independent independence results

Information processing letters, 1987-01, Vol.24 (1), p.5-10

1987

Volltextzugriff (PDF)

On the role of search for learning from examples

Journal of experimental & theoretical artificial intelligence, 2001-01, Vol.13 (1), p.25-43

2001

Volltextzugriff (PDF)

On 1-truth-table-hard languages

Theoretical computer science, 1993-07, Vol.115 (2), p.383-389

1993

Volltextzugriff (PDF)

Materials Rheology: An Overview

MRS bulletin, 1991-08, Vol.16 (8), p.15-18

Kurtz, Stuart J.

1991

Volltextzugriff (PDF)

On the role of search for learning

Annual Workshop on Computational Learning Theory: Proceedings of the second annual workshop on Computational learning theory, 1989, p.303-311

1989

Volltextzugriff (PDF)

On the relative sizes of learnable sets

Theoretical computer science, 1998-05, Vol.197 (1), p.139-156

1998

Volltextzugriff (PDF)

Johan Håstad. Computational limitations of small-depth circuits. ACM doctoral dissertation awards. The MIT Press, Cambridge, Mass., and London, 1987, xiii + 84 pp

The Journal of symbolic logic, 1988-12, Vol.53 (4), p.1259-1260

Kurtz, Stuart A.

1988

Volltextzugriff (PDF)

Johan Håstad. Computational limitations of small-depth circuits. ACM doctoral dissertation awards. The MIT Press, Cambridge, Mass., and London, 1987, xiii + 84 pp

The Journal of symbolic logic, 1988-12, Vol.53 (4), p.1259-1260

Kurtz, Stuart A.

1988

Volltextzugriff (PDF)

Extremes in the degrees of inferability

Annals of pure and applied logic, 1994-04, Vol.66 (3), p.231-276

1994

Volltextzugriff (PDF)

A discrete logarithm implementation of perfect zero-knowledge blobs

Journal of cryptology, 1990-01, Vol.2 (2), p.63-76

1990

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Detection of the benzodiazepine bromazolam by liquid chromatography with quadrupole time of flight mass spectrometry in postmortem toxicology casework and prevalence in Indiana (2023)

Gap-definable counting classes

A Computer Scientist's Perspective on Chaos and Mystery

Lemonade from lemons: Harnessing device wearout to create limited-use security architectures

Every polynomial-time 1-degree collapses if and only if P = PSPACE

The Isomorphism Conjecture Holds Relative to an Oracle

The isomorphism conjecture fails relative to a random oracle

The Undecidability of the Generalized Collatz Problem

An oracle builder’s toolkit

Sparse Sets in : Relativizations

A note on randomized polynomial time

Lemonade from Lemons: Harnessing Device Wearout to Create Limited-Use Security Architectures

Notions of weak genericity

On the random oracle hypothesis

Comment on: ‘‘Letter to the Editor: Steep wave fronts on extrudates of polymer melts and solutions,’’ by D. D. Joseph and Y. Joe Liu

How to prove representation-independent independence results

On the role of search for learning from examples

On 1-truth-table-hard languages

Materials Rheology: An Overview

On the role of search for learning

On the relative sizes of learnable sets

Johan Håstad. Computational limitations of small-depth circuits. ACM doctoral dissertation awards. The MIT Press, Cambridge, Mass., and London, 1987, xiii + 84 pp

Johan Håstad. Computational limitations of small-depth circuits. ACM doctoral dissertation awards. The MIT Press, Cambridge, Mass., and London, 1987, xiii + 84 pp

Extremes in the degrees of inferability

A discrete logarithm implementation of perfect zero-knowledge blobs

Suchergebnisse filtern