Re: Complexity of AND-OR Tree

Article View: fj.ai

Article #816

#816

From: Hideyuki Nakashima
Date: Mon, 07 Dec 1992 00:54

17 lines
1291 bytes

In article <H80Z0.1117@mtak.bsj.com> logic@mtak.bsj.com (Masami Takikawa) writes:

   >   $@J?6QE*$J7W;;NL$O!"$@$$$?$$(JAND-OR$@LZ(J
   >   $@$NMU$N?t$KHfNc$7$=$&$J(J$@5$$,$7$^$9!#$I$&$G$7$g$&$+(J?
   >
   >O(n)$@$H$$$&$N$ODc2a$.$k8+@Q$j$@$H;W$$$^$9$,!%(J

   O($@MU$N?t(J)$@$O!":G(J$@0-$N>l9g$H0lCW$7$^$;$s$+!)(J

$@$O$$!$$=$&$J$j$^$9$M!%(J
$@!J:G0-!$A4It8+$l$PNI$$$N$@$+$iEv$?$jA0!%!K(J

$@$A$g$C(J$@$H$7$?4*0c$$$G$7$?!%(J
--
Hideyuki Nakashima
Cooperative Architecture
Electrotechincal Lab.

Technical Details

Message-ID: <NAKASHIM.92Dec7095456@uranus.etl.go.jp>

Path: arc1-ca.pugleaf.net!sparky!uunet!ccut!wnoc-tyo-news!etl.go.jp!etlss2!nakashim

References: <NAGATA.92Dec3174542@as16.atr-la.atr.co.jp> <NAKASHIM.92Dec4111659@uranus.etl.go.jp> <H80Z0.1117@mtak.bsj.com>

Show Full Headers

Complete Article Headers

X-Google-Language: Japanese,JIS
X-Google-Thread: 155634,5ed613eff6887ca8
X-Google-Attributes: gid155634,public
X-Google-ArrivalTime: 1992-12-06 16:59:33 PST
Newsgroups: fj.ai
Path: arc1-ca.pugleaf.net!sparky!uunet!ccut!wnoc-tyo-news!etl.go.jp!etlss2!nakashim
From: nakashim@etl.go.jp (Hideyuki Nakashima)
Subject: Re: Complexity of AND-OR Tree
In-Reply-To: logic@mtak.bsj.com's message of 4 Dec 92 18: 09:04 GMT
Message-ID: <NAKASHIM.92Dec7095456@uranus.etl.go.jp>
Sender: news@etl.go.jp (News System)
Nntp-Posting-Host: uranus
Organization: Electrotechnical Laboratory
References: <NAGATA.92Dec3174542@as16.atr-la.atr.co.jp>
 <NAKASHIM.92Dec4111659@uranus.etl.go.jp> <H80Z0.1117@mtak.bsj.com>
Distribution: fj
Date: Mon, 7 Dec 1992 00:54:56 GMT
Lines: 19

Reply to Parent Message