On the complexity of Boolean functions computed by lazy oracles

We introduce and examine some properties of a new complexity measure for Boolean functions. Unlike classical approaches, which are largely concerned with resource requirements, the measure examined here aims at quantifying the potential for lazy evaluation in a function. This measure is motivated by...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on computers Ročník 44; číslo 4; s. 495 - 502
Hlavní autori:	Dunne, P.E., Leng, P.H., Nwana, G.F.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York, NY IEEE 01.04.1995 Institute of Electrical and Electronics Engineers
Predmet:	Applied sciences Boolean functions Circuit simulation Circuit synthesis Computer science; control theory; systems Digital systems Discrete event simulation Electronics Exact sciences and technology Formal verification Integrated circuits Logic circuits Logic design Logic functions Logic gates Logical, boolean and switching functions Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices Simulation Software Theoretical computing Electronic circuit Boolean function Symmetric function Complexity measure Computational complexity Simulator
ISSN:	0018-9340
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	We introduce and examine some properties of a new complexity measure for Boolean functions. Unlike classical approaches, which are largely concerned with resource requirements, the measure examined here aims at quantifying the potential for lazy evaluation in a function. This measure is motivated by issues arising in the implementation of demand-driven logic simulators. The range of values that can be taken by the measure is precisely identified and a lower bound on the complexity of 'almost all' Boolean functions derived. In addition asymptotically exact values are derived for the class of all Boolean symmetric functions.< >
AbstractList	We introduce and examine some properties of a new complexity measure for Boolean functions. Unlike classical approaches, which are largely concerned with resource requirements, the measure examined here aims at quantifying the potential for lazy evaluation in a function. This measure is motivated by issues arising in the implementation of demand-driven logic simulators. The range of values that can be taken by the measure is precisely identified and a lower bound on the complexity of `almost all' Boolean functions derived. In addition asymptotically exact values are derived for the class of all Boolean symmetric functions We introduce and examine some properties of a new complexity measure for Boolean functions. Unlike classical approaches, which are largely concerned with resource requirements, the measure examined here aims at quantifying the potential for lazy evaluation in a function. This measure is motivated by issues arising in the implementation of demand-driven logic simulators. The range of values that can be taken by the measure is precisely identified and a lower bound on the complexity of 'almost all' Boolean functions derived. In addition asymptotically exact values are derived for the class of all Boolean symmetric functions.< >
Author	Dunne, P.E. Nwana, G.F. Leng, P.H.
Author_xml	– sequence: 1 givenname: P.E. surname: Dunne fullname: Dunne, P.E. organization: Dept. of Comput. Sci., Liverpool Univ., UK – sequence: 2 givenname: P.H. surname: Leng fullname: Leng, P.H. organization: Dept. of Comput. Sci., Liverpool Univ., UK – sequence: 3 givenname: G.F. surname: Nwana fullname: Nwana, G.F. organization: Dept. of Comput. Sci., Liverpool Univ., UK
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=3518937$$DView record in Pascal Francis
BookMark	eNpt0D1PwzAQBmAPRaItDKxMGRASQ1p_NIk9Iaj4kip1gTm6OLYwcu1iOxLl15OSCiTEdMM97530TtDIeacQOiN4RggWc0JnrCpJWYzQGGPCc8EW-BhNYnzDGJcUizG6XrssvapM-s3Wqg-TdpnX2a33VoHLdOdkMt7F732XVJs1u8zCZ68CSKviCTrSYKM6Pcwperm_e14-5qv1w9PyZpVLhsuUy0ZDoYAIXVHcVJXQuJWSMaASKIWK4XaBGYaGNVxroSrNNZG8gYK00AJjU3Q53N0G_96pmOqNiVJZC075LtaUL0oueNHDiwOEKMHqAE6aWG-D2UDY1awgXLCqZ1cDk8HHGJT-EQTX-_ZqQuuhvd7O_1hpEux7SQGM_TdxPiSMUur397D8AmBffdk
CODEN	ITCOB4
CitedBy_id	crossref_primary_10_1137_S0097539795290349 crossref_primary_10_1137_S0097539797328070 crossref_primary_10_1016_S1383_7621_02_00062_0 crossref_primary_10_1137_S0097539794261556 crossref_primary_10_1137_S0097539792282965 crossref_primary_10_1137_S0097539798345944 crossref_primary_10_1137_S0097539794275136
Cites_doi	10.1145/362848.362870 10.1109/C-M.1975.218898 10.1002/sapm194221183 10.1145/37888.37915 10.1145/800168.811543 10.1002/j.1538-7305.1949.tb03624.x 10.1016/0010-4485(91)90049-3 10.1214/aoms/1177729330
ContentType	Journal Article
Copyright	1995 INIST-CNRS
Copyright_xml	– notice: 1995 INIST-CNRS
DBID	AAYXX CITATION IQODW 7SC 8FD JQ2 L7M L~C L~D
DOI	10.1109/12.376165
DatabaseName	CrossRef Pascal-Francis Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional
DatabaseTitleList	Computer and Information Systems Abstracts
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science Applied Sciences
EndPage	502
ExternalDocumentID	3518937 10_1109_12_376165 376165
GroupedDBID	--Z -DZ -~X .55 .DC 0R~ 29I 3EH 3O- 4.4 5GY 5VS 6IK 85S 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACIWK ACNCT AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD HZ~ H~9 IAAWW IBMZZ ICLAB IEDLZ IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ MVM O9- OCL P2P PQQKQ RIA RIE RNI RNS RXW RZB TAE TN5 TWZ UHB UKR UPT VH1 X7M XJT XOL XZL YXB YYQ YZZ ZCG AAYXX ABUFD CITATION IQODW RIG 7SC 8FD JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c306t-cbfa5ea19f720b779f0dcc33a2ca22a730d4030ab3b8ff9e7f8f1c8ba51dada33
IEDL.DBID	RIE
ISICitedReferencesCount	0
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=10_1109_12_376165&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0018-9340
IngestDate	Sun Nov 09 09:41:49 EST 2025 Mon Jul 21 09:17:03 EDT 2025 Sat Nov 29 03:56:53 EST 2025 Tue Nov 18 19:37:14 EST 2025 Wed Aug 27 02:49:02 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	4
Keywords	Electronic circuit Boolean function Symmetric function Complexity measure Computational complexity Simulator
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c306t-cbfa5ea19f720b779f0dcc33a2ca22a730d4030ab3b8ff9e7f8f1c8ba51dada33
Notes	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
PQID	28468985
PQPubID	23500
PageCount	8
ParticipantIDs	crossref_primary_10_1109_12_376165 ieee_primary_376165 crossref_citationtrail_10_1109_12_376165 proquest_miscellaneous_28468985 pascalfrancis_primary_3518937
PublicationCentury	1900
PublicationDate	1995-04-01
PublicationDateYYYYMMDD	1995-04-01
PublicationDate_xml	– month: 04 year: 1995 text: 1995-04-01 day: 01
PublicationDecade	1990
PublicationPlace	New York, NY
PublicationPlace_xml	– name: New York, NY
PublicationTitle	IEEE transactions on computers
PublicationTitleAbbrev	TC
PublicationYear	1995
Publisher	IEEE Institute of Electrical and Electronics Engineers
Publisher_xml	– name: IEEE – name: Institute of Electrical and Electronics Engineers
References	BIBC049511 BIBC04956 BIBC049514 smith (BIBC049512) 1987 BIBC049513 dunne (BIBC04953) 1988 BIBC04952 BIBC04951 riordan (BIBC049510) 1942; 21 jackson (BIBC04957) 1986 korshunov (BIBC04959) 1981; 38 dunne (BIBC04955) 1993 jackson (BIBC04958) 1987 dunne (BIBC04954) 1991; 8
References_xml	– year: 1988 ident: BIBC04953 publication-title: The Complexity of Boolean Networks – ident: BIBC049514 doi: 10.1145/362848.362870 – ident: BIBC049513 doi: 10.1109/C-M.1975.218898 – volume: 21 start-page: 83 year: 1942 ident: BIBC049510 article-title: the number of two-terminal series-parallel networks publication-title: J Math and Phys doi: 10.1002/sapm194221183 – start-page: 86 year: 1987 ident: BIBC04958 article-title: modeling and simulation ofdigital logic: an alternative approach publication-title: Proc 16th IASTED Int?l Symp Identification Modeling and Simulation – volume: 38 start-page: 5 year: 1981 ident: BIBC04959 article-title: on the number of monotone boolean functions publication-title: Problemy Kibernet – start-page: 181 year: 1987 ident: BIBC049512 article-title: demand driven simulation: backsim publication-title: 24th ACM/IEEE Design Automation Conference doi: 10.1145/37888.37915 – ident: BIBC04956 doi: 10.1145/800168.811543 – ident: BIBC049511 doi: 10.1002/j.1538-7305.1949.tb03624.x – ident: BIBC04951 doi: 10.1016/0010-4485(91)90049-3 – volume: 8 start-page: 269 year: 1991 ident: BIBC04954 article-title: an algorithm for optimizing signal selection indemand-driven circuit simulation publication-title: Trans Soc Computer Simulation – ident: BIBC04952 doi: 10.1214/aoms/1177729330 – start-page: 61 year: 1993 ident: BIBC04955 article-title: distributed logic simulation on anetwork of unix workstations publication-title: Proc UKUUG and SUN UK User Group Joint New Year 1993 Conf – year: 1986 ident: BIBC04957 article-title: the generation of systems for microarchitectural simulation publication-title: ?The generation of systems for microarchitectural simulation ?
SSID	ssj0006209
Score	1.4575628
Snippet	We introduce and examine some properties of a new complexity measure for Boolean functions. Unlike classical approaches, which are largely concerned with...
SourceID	proquest pascalfrancis crossref ieee
SourceType	Aggregation Database Index Database Enrichment Source Publisher
StartPage	495
SubjectTerms	Applied sciences Boolean functions Circuit simulation Circuit synthesis Computer science; control theory; systems Digital systems Discrete event simulation Electronics Exact sciences and technology Formal verification Integrated circuits Logic circuits Logic design Logic functions Logic gates Logical, boolean and switching functions Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices Simulation Software Theoretical computing
Title	On the complexity of Boolean functions computed by lazy oracles
URI	https://ieeexplore.ieee.org/document/376165 https://www.proquest.com/docview/28468985
Volume	44
WOSCitedRecordID	wos10_1109_12_376165&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVIEE databaseName: IEEE/IET Electronic Library (IEL) (UW System Shared) issn: 0018-9340 databaseCode: RIE dateStart: 19680101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://ieeexplore.ieee.org/ omitProxy: false ssIdentifier: ssj0006209 providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8QwEB508aAHH6vi-gziwUu1aZumOYmK4kk9KHgrkxcISyv7EPXXm6TtqujFW2mmocxkXslkPoAj5sIEJWMV5dxmUZZwFmEiTKRlJrUopMsAsgA2wW9vi6cncd_22Q53YYwxofjMnPjHcJavazX1W2WnThlozuZhnnPeXNWaGd28q-agTn_TLG6bCNFYnNLkpPnwh-sJWCq-EhLHjhm2QbH4ZZCDl7le-df_rcJyG0yS80b6azBnqj6sdEANpNXbPix96zq4Dmd3FXFhHwnV5ObNheGktuSirocGK-IdXViLYdzNo4l8J0P8cFQj9DV0G_B4ffVweRO1OAqRcgnBJFLSIjNIheVJLDkXNtZKpSkmCpMEnY7rzOk6ylQW1grDbWGpKiQyqlFjmm5Cr6orswWEpcLkHGOhM5qhS12cMTVMacupkazIB3DcsbhUbZNxj3UxLEOyEYuSJmXDpgEczkhfms4afxH1PZtnBN3bvR9i-xpm1MdfAzjoxFg6bfFHIFiZejounTPOC1Gw7T_n3YHF5sa6L8zZhd5kNDV7sKBeJ8_j0X5YcJ8gtdVw
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NTxUxEJ8okqgHwSeGJyIN8eBlYdttt9sTUSLBCA8PmHDbTL8Skpdd8j6I-tfbdnefELlw22xnm81M56udzg_gowhhgtG5yUrpecaZFBky5TKrubaq0iED4AlsQk4m1dWV-tH32U53YZxzqfjMHcTHdJZvW7OMW2WHQRloKZ7CM8E5o91lrZXZLYd6Dho0uOB530aI5uqQsoPu03vOJ6GpxFpInAd2-A7H4j-TnPzMycaj_nATXvXhJPncyf81PHHNCDYGqAbSa-4IXt7pO_gGji4aEgI_kurJ3a8QiJPWky9tO3XYkOjq0mpM42EeS_RvMsU_gWqGsYpuC36efL08Ps16JIXMhJRgkRntUTikykuWaymVz60xRYHMIGMYtNzyoO2oC115r5z0laem0iioRYtF8RbWmrZx20BEoVwpMVeWU44heQnm1AljvaROi6ocw6eBxbXp24xHtItpndKNXNWU1R2bxrC_Ir3pems8RDSKbF4RDG9374nt37CgMQIbw94gxjroSzwEwca1y3kd3HFZqUq8e3DePXh-enl-Vp99m3zfgRfd_fVYpvMe1hazpduFdXO7uJ7PPqTF9xdeU9i3
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+the+complexity+of+Boolean+functions+computed+by+lazy+oracles&rft.jtitle=IEEE+transactions+on+computers&rft.au=Dunne%2C+P.E.&rft.au=Leng%2C+P.H.&rft.au=Nwana%2C+G.F.&rft.date=1995-04-01&rft.issn=0018-9340&rft.volume=44&rft.issue=4&rft.spage=495&rft.epage=502&rft_id=info:doi/10.1109%2F12.376165&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_12_376165
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9340&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9340&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9340&client=summon