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
[2]
Hilfe
Suche: Author="Nishino, Tetsuro"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A characterization of
k
-th powers
P_{n,k}
of paths in terms of
k
-trees
Koich Yamazaki
,
Sei'ichi Tani
,
Tetsuro Nishino
International Journal of Foundations of Computer Science
12
(4), 2001, pp. 435-443
On the complexity of negation-limited Boolean networks
Robert Beals
,
Tetsuro Nishino
,
Keisuke Tanaka
SIAM Journal on Computing
27
(5), 1998, pp. 1334-1347
Negation-limited circuit complexity of symmetric functions
Keisuke Tanaka
,
Tetsuro Nishino
,
Robert Beals
Information Processing Letters
59
(5), 1996, pp. 273-279
More on the complexity of negation-limited circuits
Robert Beals
,
Tetsuro Nishino
,
Keisuke Tanaka
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, STOC'95 (Las Vegas, Nevada, USA, May 29 - June 1, 1995)
, 1995, pp. 585-595
Quantum computation and
NP
-complete problems
Takashi Mihara
,
Tetsuro Nishino
Lecture Notes in Computer Science
834
, 1994, pp. 387-395
On the complexity of negation-limited Boolean networks
Keisuke Tanaka
,
Tetsuro Nishino
Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC'94 (Montréal, Québec, Canada, May 23-25, 1994)
, 1994, pp. 38-47