|
|
SFX by Ex Libris Inc.
|
List of services to meet your request
|
||||||||||||
|
||||||||||||
© 2024 SFX by Ex Libris Inc. | Cookie Policy
CrossRef Omogočeno
![](https://beacon01.alma.exlibrisgroup.com/boom/apache_pb.gif?SRVR=adz.izum.si&IP=193.2.126.232&A=SFX&P=SFXMenu&S=s4CABF264-4C00-11EF-BEFD-9A1285CE164B&I=39IZM&T=&OP=Display&O=html&O1=13976783&O2=3420000000000374&O3=&O4=summon.serialssolutions.com&O5=https%3A%2F%2Fadz.izum.si%2Fsfxlcl41%3Fctx_enc%3Dinfo%253Aofi%252Fenc%253AUTF-8%26ctx_ver%3DZ39.88-2004%26rfr_id%3Dinfo%253Asid%252Fsummon.serialssolutions.com%26rft.atitle%3DAn%2520Upper%2520Bound%2520on%2520Checking%2520Test%2520Complexity%2520for%2520Almost%2520All%2520Cographs%26rft.au%3DChistikov%252C%2520D.%2520V.%26rft.au%3DVoronenko%252C%2520A.%2520A.%26rft.au%3DZubkov%252C%2520O.%2520V.%26rft.date%3D2011-09-01%26rft.epage%3D330%26rft.externalDocID%3D6169598%26rft.genre%3Dproceeding%26rft.isbn%3D9781467302074%26rft.pub%3DIEEE%26rft.spage%3D323%26rft.title%3D2011%252013th%2520International%2520Symposium%2520on%2520Symbolic%2520and%2520Numeric%2520Algorithms%2520for%2520Scientific%2520Computing%26rft_id%3Dinfo%253Adoi%252F10.1109%252FSYNASC.2011.44%26rft_val_fmt%3Dinfo%253Aofi%252Ffmt%253Akev%253Amtx%253Abook&O6=1-IEEE_ELECTRONIC_LIBRARY_IEL_UL_LCL-getFullTxt-object,2-IEEE_ELECTRONIC_LIBRARY_IEL_UM_LCL-getFullTxt-object,3-IEEE_IET_ELECTRONIC_LIBRARY_IEL-getFullTxt-object,4-IEEE_ELECTRONIC_LIBRARY_IEL_CONFERENCE_PROCEEDINGS-getFullTxt-object,5-IEEE_ELECTRONIC_LIBRARY_IEL_CONFERENCE_PROCEEDINGS_UL_LCL-getFullTxt-object,6-IEEE_ELECTRONIC_LIBRARY_IEL_CONFERENCE_PROCEEDINGS_UM_LCL-getFullTxt-object,7-DOI-getDOI-object,8-COBIB_SI_LCL-getHolding-object,9-AMAZON_FREE-getBookReview-object,10-REFWORKS_EXPORT_TOOL-getReference-object,11-GOOGLE_BOOK_SEARCH-getWebSearch-object,12-GOOGLE_SCHOLAR_FREE-getWebSearch-object,13-WWW_SEARCH_ENGINES_FREE-getWebSearch-object&O7=1.24929&O8=N&O9=<ctx:context-object identifier="urn:sfxstat:13976783-s4CABF264-4C00-11EF-BEFD-9A1285CE164B" timestamp="2024-07-27T12:09:25Z" xmlns:ctx="info:ofi/fmt:xml:xsd:ctx">
<ctx:referent>
<ctx:identifier>urn:sfxid:3420000000000374</ctx:identifier>
<ctx:metadata-by-val>
<ctx:format>info:ofi/fmt:xml:xsd:journal</ctx:format>
<ctx:metadata>
<jnl:journal xmlns:jnl="info:ofi/fmt:xml:xsd:journal">
<jnl:atitle>An Upper Bound on Checking Test Complexity for Almost All Cographs</jnl:atitle>
<jnl:jtitle>2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing</jnl:jtitle>
<jnl:date>2011-09-00</jnl:date>
<jnl:spage>323</jnl:spage>
<jnl:epage>330</jnl:epage>
<jnl:genre>proceeding</jnl:genre>
<jnl:language>eng</jnl:language>
<jnl:authors></jnl:authors>
</jnl:journal>
</ctx:metadata>
</ctx:metadata-by-val>
</ctx:referent>
<ctx:requester>
<ctx:identifier>urn:ip:409383508f8ce7bc395f6be721a7ce1280a87641</ctx:identifier>
<ctx:identifier>urn:UUID:s4CABF264-4C00-11EF-BEFD-9A1285CE164B</ctx:identifier>
</ctx:requester>
<ctx:referrer>
<ctx:identifier>info:sid/summon.serialssolutions.com</ctx:identifier>
</ctx:referrer>
<ctx:service-type>
<ctx:metadata-by-val>
<ctx:format>info:ofi/fmt:xml:xsd:svcList</ctx:format>
<ctx:metadata>
<svc:svcList xmlns:svc="http://www.exlibrisgroup.com/schema/info:ofi/fmt:xml:xsd:sch_svc"></svc:svcList>
</ctx:metadata>
</ctx:metadata-by-val>
</ctx:service-type>
<ctx:resolver>
<ctx:identifier>https://adz.izum.si/sfxlcl41</ctx:identifier>
</ctx:resolver>
</ctx:context-object>
&)