首页 > 最新文献

Computational Complexity最新文献

英文 中文
Low-degree test with polynomially small error 多项式小误差的低阶检验
IF 1.4 3区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Computational Complexity
Pub Date : 2016-12-19 DOI: 10.1007/s00037-016-0149-4
Dana Moshkovitz
{"title":"Low-degree test with polynomially small error","authors":"Dana Moshkovitz","doi":"10.1007/s00037-016-0149-4","DOIUrl":"https://doi.org/10.1007/s00037-016-0149-4","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"26 1","pages":"531 - 582"},"PeriodicalIF":1.4,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-016-0149-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41993888","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Graph Isomorphism, Color Refinement, and Compactness 图同构、颜色细化和紧致性
IF 1.4 3区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Computational Complexity
Pub Date : 2016-12-19 DOI: 10.1007/s00037-016-0147-6
V. Arvind, J. Köbler, Gaurav Rattan, O. Verbitsky
{"title":"Graph Isomorphism, Color Refinement, and Compactness","authors":"V. Arvind, J. Köbler, Gaurav Rattan, O. Verbitsky","doi":"10.1007/s00037-016-0147-6","DOIUrl":"https://doi.org/10.1007/s00037-016-0147-6","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"26 1","pages":"627 - 685"},"PeriodicalIF":1.4,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-016-0147-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51809675","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 31
On Approximating the Eigenvalues of Stochastic Matrices in Probabilistic Logspace 关于概率对数空间中随机矩阵特征值的逼近
IF 1.4 3区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Computational Complexity
Pub Date : 2016-12-16 DOI: 10.1007/s00037-016-0150-y
Dean Doron, Amir Sarid, A. Ta-Shma
{"title":"On Approximating the Eigenvalues of Stochastic Matrices in Probabilistic Logspace","authors":"Dean Doron, Amir Sarid, A. Ta-Shma","doi":"10.1007/s00037-016-0150-y","DOIUrl":"https://doi.org/10.1007/s00037-016-0150-y","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"26 1","pages":"393 - 420"},"PeriodicalIF":1.4,"publicationDate":"2016-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-016-0150-y","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43301684","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
On the hardness of the noncommutative determinant 关于非交换行列式的硬度
IF 1.4 3区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Computational Complexity
Pub Date : 2016-11-30 DOI: 10.1007/s00037-016-0148-5
V. Arvind, S. Srinivasan
{"title":"On the hardness of the noncommutative determinant","authors":"V. Arvind, S. Srinivasan","doi":"10.1007/s00037-016-0148-5","DOIUrl":"https://doi.org/10.1007/s00037-016-0148-5","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"27 1","pages":"1 - 29"},"PeriodicalIF":1.4,"publicationDate":"2016-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-016-0148-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51809709","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 27
Suboptimal implementation of diagnostic algorithms and overuse of computed tomography-pulmonary angiography in patients with suspected pulmonary embolism. 在疑似肺栓塞患者中，诊断算法的实施效果不佳，以及过度使用计算机断层扫描-肺血管造影术。
IF 2.3 3区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Computational Complexity
Pub Date : 2016-10-01 DOI: 10.4103/1817-1737.191875
Sulaiman Alhassan, Alaa Abu Sayf, Camelia Arsene, Hicham Krayem

Background: Majority of our computed tomography-pulmonary angiography (CTPA) scans report negative findings. We hypothesized that suboptimal reliance on diagnostic algorithms contributes to apparent overuse of this test.

Methods: A retrospective review was performed on 2031 CTPA cases in a large hospital system. Investigators retrospectively calculated pretest probability (PTP). Use of CTPA was considered as inappropriate when it was ordered for patients with low PTP without checking D-dimer (DD) or following negative DD.

Results: Among the 2031 cases, pulmonary embolism (PE) was found in 7.4% (151 cases). About 1784 patients (88%) were considered "PE unlikely" based on Wells score. Out of those patients, 1084 cases (61%) did not have DD test prior to CTPA. In addition, 78 patients with negative DD underwent unnecessary CTPA; none of them had PE.

Conclusions: The suboptimal implementation of PTP assessment tools can result in the overuse of CTPA, contributing to ineffective utilization of hospital resources, increased cost, and potential harm to patients.

背景：我们的大多数计算机断层扫描-肺血管造影（CTPA）扫描结果均为阴性。我们推测，对诊断算法的次优依赖导致了该检查的明显过度使用：方法：对一家大型医院系统的 2031 个 CTPA 病例进行了回顾性分析。研究人员回顾性地计算了检查前概率（PTP）。如果未检查 D-二聚体 (DD)，或在 DD 阴性后为 PTP 较低的患者开具 CTPA 检查单，则认为 CTPA 的使用是不恰当的：在 2031 例患者中，7.4%（151 例）发现肺栓塞（PE）。根据威尔斯评分，约有 1784 例患者（88%）被认为 "不太可能发生 PE"。在这些患者中，有 1084 例（61%）在 CTPA 之前没有进行 DD 检测。此外，78 名 DD 阴性的患者接受了不必要的 CTPA，但他们都没有发生 PE：结论：PTP 评估工具的不理想实施会导致 CTPA 的过度使用，造成医院资源的无效利用、成本增加以及对患者的潜在伤害。
{"title":"Suboptimal implementation of diagnostic algorithms and overuse of computed tomography-pulmonary angiography in patients with suspected pulmonary embolism.","authors":"Sulaiman Alhassan, Alaa Abu Sayf, Camelia Arsene, Hicham Krayem","doi":"10.4103/1817-1737.191875","DOIUrl":"10.4103/1817-1737.191875","url":null,"abstract":"<p><strong>Background: </strong>Majority of our computed tomography-pulmonary angiography (CTPA) scans report negative findings. We hypothesized that suboptimal reliance on diagnostic algorithms contributes to apparent overuse of this test.</p><p><strong>Methods: </strong>A retrospective review was performed on 2031 CTPA cases in a large hospital system. Investigators retrospectively calculated pretest probability (PTP). Use of CTPA was considered as inappropriate when it was ordered for patients with low PTP without checking D-dimer (DD) or following negative DD.</p><p><strong>Results: </strong>Among the 2031 cases, pulmonary embolism (PE) was found in 7.4% (151 cases). About 1784 patients (88%) were considered \"PE unlikely\" based on Wells score. Out of those patients, 1084 cases (61%) did not have DD test prior to CTPA. In addition, 78 patients with negative DD underwent unnecessary CTPA; none of them had PE.</p><p><strong>Conclusions: </strong>The suboptimal implementation of PTP assessment tools can result in the overuse of CTPA, contributing to ineffective utilization of hospital resources, increased cost, and potential harm to patients.</p>","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"19 1","pages":"254-260"},"PeriodicalIF":2.3,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5070434/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73428850","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Dual VP Classes 双副总裁类
IF 1.4 3区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Computational Complexity
Pub Date : 2016-09-23 DOI: 10.1007/s00037-016-0146-7
E. Allender, A. Gál, Ian Mertz
{"title":"Dual VP Classes","authors":"E. Allender, A. Gál, Ian Mertz","doi":"10.1007/s00037-016-0146-7","DOIUrl":"https://doi.org/10.1007/s00037-016-0146-7","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"26 1","pages":"583 - 625"},"PeriodicalIF":1.4,"publicationDate":"2016-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-016-0146-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51809655","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Asymptotic tensor rank of graph tensors: beyond matrix multiplication 图张量的渐近张量秩:超越矩阵乘法
IF 1.4 3区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Computational Complexity
Pub Date : 2016-09-23 DOI: 10.1007/s00037-018-0172-8
M. Christandl, Péter Vrana, Jeroen Zuiddam
{"title":"Asymptotic tensor rank of graph tensors: beyond matrix multiplication","authors":"M. Christandl, Péter Vrana, Jeroen Zuiddam","doi":"10.1007/s00037-018-0172-8","DOIUrl":"https://doi.org/10.1007/s00037-018-0172-8","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"28 1","pages":"57 - 111"},"PeriodicalIF":1.4,"publicationDate":"2016-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-018-0172-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51809782","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
Matrix rigidity of random Toeplitz matrices 随机Toeplitz矩阵的矩阵刚度
IF 1.4 3区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Computational Complexity
Pub Date : 2016-09-01 DOI: 10.1007/s00037-016-0144-9
O. Goldreich, Avishay Tal
{"title":"Matrix rigidity of random Toeplitz matrices","authors":"O. Goldreich, Avishay Tal","doi":"10.1007/s00037-016-0144-9","DOIUrl":"https://doi.org/10.1007/s00037-016-0144-9","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"27 1","pages":"305 - 350"},"PeriodicalIF":1.4,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-016-0144-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51809602","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Topological lower bounds for arithmetic networks 算法网络的拓扑下界
IF 1.4 3区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Computational Complexity
Pub Date : 2016-09-01 DOI: 10.1007/s00037-016-0145-8
A. Gabrielov, Nicolai N. Vorobjov
{"title":"Topological lower bounds for arithmetic networks","authors":"A. Gabrielov, Nicolai N. Vorobjov","doi":"10.1007/s00037-016-0145-8","DOIUrl":"https://doi.org/10.1007/s00037-016-0145-8","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"56 3 1","pages":"687 - 715"},"PeriodicalIF":1.4,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-016-0145-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51809622","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Special Issue on the 10th Theory of Cryptography Conference: Editor’s Foreword 第十届密码学理论会议特刊编者序
IF 1.4 3区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Computational Complexity
Pub Date : 2016-08-30 DOI: 10.1007/s00037-015-0119-2
O. Goldreich
{"title":"Special Issue on the 10th Theory of Cryptography Conference: Editor’s Foreword","authors":"O. Goldreich","doi":"10.1007/s00037-015-0119-2","DOIUrl":"https://doi.org/10.1007/s00037-015-0119-2","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"25 1","pages":"563 - 565"},"PeriodicalIF":1.4,"publicationDate":"2016-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-015-0119-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51808401","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
类型
全部 化学•材料 生命科学 医学 物理 工程技术 环境•农林 材料科学 地球科学 法学 管理学 化学 环境科学与生态学 计算机科学 教育学 经济学 农林科学 人文科学 生物学 数学 物理与天体物理 心理学 综合性期刊 其他 工业工程 理学 历史学 农学 文学 信息工程
数据库
全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley
期刊
Computational Complexity
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
﹀
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们：info@booksci.cn
Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1