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="Buss, S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the hardness of approximating label-cover
Irit Dinur
,
Shmuel Safra
Information Processing Letters
89
(5), 2004, pp. 247-254
An optimal parallel algorithm for formula evaluation
S. Buss
,
S. Cook
,
A. Gupta
,
V. Ramachandran
SIAM Journal on Computing
21
(4), 1992, August, pp. 755-780
On the predictability of coupled automata: An allegory about chaos
S. Buss
,
C.H. Papadimitriou
,
J.N. Tsitsiklis
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 788-793
On truth-table reducibility to SAT and the difference hierarchy over
NP
S.R. Buss
,
L. Hay
Proceedings of the 3rd Annual Conference on Structure in Complexity Theory, CSCT'88 (Georgetown University, Washington D.C., June 14-17 1988)
, 1988, pp. 224-233
The boolean formula value problem is in ALOGTIME
S.R. Buss
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)
, 1987, pp. 123-131
The polynomial hierarchy and intuitionistic bounded arithmetic
S. Buss
Lecture Notes in Computer Science
223
, 1986, pp. 77-103
The Boolean formula value problem is in ALOGTIME
S.R. Buss
misc, 1986
Polynomial size proofs of the propositional pigeonhole principle
S.R. Buss
misc, 1986, April
The polynomial hierarchy and fragments of bounded arithmetic
S.R. Buss
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, STOC'85 (Providence, RI, May 6-8, 1985)
, 1985, pp. 285-290