Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Regan, K."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On closure properties of bounded two-sided error complexity classes
K.W. Regan
,
J.S. Royer
Math. Systems Theory
28
(3), 1995, pp. 229-243
Finitary substructure languages with application to the theory of
NP
-completeness
K.W. Regan
Proceedings of the 4th Annual Conference on Structure in Complexity Theory, CSCT'89 (University of Oregon, Eugene, Oregon, June 19-22, 1989)
, 1989, pp. 87-96
Unprovably intractable languages
K.W. Regan
Proceedings of the 2nd Annual Conference on Structure in Complexity Theory, CSCT'87 (Cornell University, Ithaca, NY, June 16-19, 1987)
, 1987, pp. 69-80
The topology of provability in complexity theory
K. Regan
Lecture Notes in Computer Science
223
, 1986, pp. 291-310