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="Balc{\'a}zar, J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Provably fast training algorithms for support vector machines
José L. Balcázar
,
Yang Dai
,
Junichi Tanaka
,
Osamu Watanabe
Theory of Computing Systems
42
(4), 2008, pp. 568-595
Generalized Kolmogorov complexity in relativized separations
R. Gavaldà
,
L. Torenvliet
,
O. Watanabe
,
J.L. Balcázar
Lecture Notes in Computer Science
452
, 1990, pp. 269-276
Nondeterministic witnesses and nonuniform advice
J.L. Balcázar
Proceedings of the 4th Annual Conference on Structure in Complexity Theory, CSCT'89 (University of Oregon, Eugene, Oregon, June 19-22, 1989)
, 1989, pp. 259-269
Logspace self-reducibility
J.L. Balcázar
Proceedings of the 3rd Annual Conference on Structure in Complexity Theory, CSCT'88 (Georgetown University, Washington D.C., June 14-17 1988)
, 1988, pp. 40-46
Strong and robustly strong polynomial time reducibilities to sparse sets
R. Gavaldà
,
J.L. Balcázar
Lecture Notes in Computer Science
324
, 1988, pp. 300-308
On characterizations of the class PSPACE/poly
J.L. Balcázar
,
J. Díaz
,
J. Gabarró
Theoretical Computer Science
52
(3), 1987, pp. 251-267
Self-reducibility
J.L. Balcázar
Lecture Notes in Computer Science
247
, 1987, pp. 136-147
The polynomial-time hierarchy and sparse oracles
J.L. Balcázar
,
R.V. Book
,
U. Schöning
Journal of the ACM
33
(3), 1986, pp. 603-617
Sparse sets, lowness and highness
J.L. Balcázar
,
R.V. Book
,
U. Schöning
SIAM Journal on Computing
15
(3), 1986, August, pp. 739-747
Sets with small generalized Kolmogorov complexity
J.L. Balcázar
,
R.V. Book
Acta Informatica
23
(6), 1986, pp. 679-688
On non-uniform polynomial space
J. Balcázar
,
J. Díaz
,
J. Gabarró
Lecture Notes in Computer Science
223
, 1986, pp. 35-50
On
\Delta_2^P
-immunity (complexity)
J.L. Balcázar
Information Processing Letters
23
(1), 1986, July, pp. 25-28
On bounded query machines
J.L. Balcázar
,
R.V. Book
,
U. Schöning
Theoretical Computer Science
40
(2,3), 1985, pp. 237-243
Uniform characterizations of non-uniform complexity measures
J.L. Balcázar
,
J. Díaz
,
J. Gabarró
Information and Control
67
(1-3), 1985, pp. 53-69
On some ``non-uniform'' complexity measures
J.L. Balcázar
,
J. Díaz
,
J. Gabarró
Lecture Notes in Computer Science
199
, 1985, pp. 18-27
Simplicity, relativizations and nondeterminism
J.L. Balcázar
SIAM Journal on Computing
14
(1), 1985, February, pp. 148-157
Sparse oracles and uniform complexity classes
J. Balcázar
,
R. Book
,
T. Long
,
U. Schöning
,
A. Selman
Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, FOCS'84 (Singer Island, FL, October 24-26, 1984)
, 1984, pp. 308-311
A note on a theorem by Ladner
J.L. Balcázar
,
J. Diaz
Information Processing Letters
15
(2), 1982, September, pp. 84-86