Re: Complexity of AND-OR Tree

Article View: fj.ai

Article #812

#812

From: Masami Takikawa
Date: Fri, 04 Dec 1992 18:09

19 lines
1377 bytes

AI $B$O$:$C$H@N$K$7$F$$$?$@$1!J(JWOL$B$K$b9T$C$?$3$H$,$"$k!KBl@n$G$9!#(J

In article <NAKASHIM.92Dec4111659@uranus.etl.go.jp>
	nakashim@etl.go.jp (Hideyuki Nakashima) writes:
>$BDL>o$O(J $BJ?6Q;^J,$+$l?t(Jm^$BJ?6Q?<$5(Jn (O(M^n))$B$G$9$M!%(Jand$B$+(Jor$B$+$O7W;;(J
>$B%*!<%@!<$K$O4X78$J$$$H;W$$$^$9!%(J

$B$=$&;W$$$^$9!#$G!":G0-$N>l9g$O!"(J
$O(\mbox{$BJ?6Q;^J,$+$l?t(J}^\mbox{$B:GBg?<$5(J})$
$B$G$9$h$M!#$=$&$@$H$9$k$H!"(J

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

O($BMU$N?t(J)$B$O!":G0-$N>l9g$H0lCW$7$^$;$s$+!)(J
--
$B$?$-$+$o!w$*$l$4$s(J

Technical Details

Message-ID: <H80Z0.1117@mtak.bsj.com>

Path: arc1-ca.pugleaf.net!sparky!uunet!bsjsun!mtak!logic

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

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-05 04:21:28 PST
Path: arc1-ca.pugleaf.net!sparky!uunet!bsjsun!mtak!logic
From: logic@mtak.bsj.com (Masami Takikawa)
Newsgroups: fj.ai
Subject: Re: Complexity of AND-OR Tree
Message-ID: <H80Z0.1117@mtak.bsj.com>
Date: 4 Dec 92 18:09:04 GMT
References: <NAGATA.92Dec3174542@as16.atr-la.atr.co.jp>
 <NAKASHIM.92Dec4111659@uranus.etl.go.jp>
Reply-To: logic@mtak.bsj.com (Masami Takikawa)
Distribution: fj
Organization: The Takikawa, Corvallis, Oregon, U.S.A.
Lines: 20
Posting-Front-End: Terakoya-u kaku 2.04 March 31, 1990

Reply to Parent Message