发布求助
文献互助 智能选刊 最新文献

Spin最新文献

筛选
英文 中文
Efficient Implementation of LIMDDs for Quantum Circuit Simulation 量子电路模拟中limdd的高效实现
IF 1.8 4区 物理与天体物理
Spin Pub Date : 2023-01-01 DOI: 10.1007/978-3-031-32157-3_1
Lieuwe Vinkhuijzen, Thomas Grurl, S. Hillmich, Sebastiaan Brand, R. Wille, A. Laarman
{"title":"Efficient Implementation of LIMDDs for Quantum Circuit Simulation","authors":"Lieuwe Vinkhuijzen, Thomas Grurl, S. Hillmich, Sebastiaan Brand, R. Wille, A. Laarman","doi":"10.1007/978-3-031-32157-3_1","DOIUrl":"https://doi.org/10.1007/978-3-031-32157-3_1","url":null,"abstract":"","PeriodicalId":54319,"journal":{"name":"Spin","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76816557","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
NP-Hardness of Almost Coloring Almost 3-Colorable Graphs 概着色概3色图的np -硬度
IF 1.8 4区 物理与天体物理
Spin Pub Date : 2023-01-01 DOI: 10.4230/LIPIcs.APPROX/RANDOM.2023.51
Yahli Hecht, Dor Minzer, S. Safra
{"title":"NP-Hardness of Almost Coloring Almost 3-Colorable Graphs","authors":"Yahli Hecht, Dor Minzer, S. Safra","doi":"10.4230/LIPIcs.APPROX/RANDOM.2023.51","DOIUrl":"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.51","url":null,"abstract":"A graph G = ( V, E ) is said to be ( k, δ ) almost colorable if there is a subset of vertices V ′ ⊆ V of size at least (1 − δ ) | V | such that the induced subgraph of G on V ′ is k -colorable. We prove that for all k , there exists δ > 0 such for all ε > 0, given a graph G it is NP-hard (under randomized reductions) to distinguish between:","PeriodicalId":54319,"journal":{"name":"Spin","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83522133","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Model Checking Futexes 模型检查Futexes
IF 1.8 4区 物理与天体物理
Spin Pub Date : 2023-01-01 DOI: 10.1007/978-3-031-32157-3_3
Hugues Evrard, A. Donaldson
{"title":"Model Checking Futexes","authors":"Hugues Evrard, A. Donaldson","doi":"10.1007/978-3-031-32157-3_3","DOIUrl":"https://doi.org/10.1007/978-3-031-32157-3_3","url":null,"abstract":"","PeriodicalId":54319,"journal":{"name":"Spin","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89872216","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP Rounding 基于LP舍入新方法的分区矩阵装箱AFPTAS
IF 1.8 4区 物理与天体物理
Spin Pub Date : 2023-01-01 DOI: 10.4230/LIPIcs.APPROX/RANDOM.2023.22
Ilan Doron Arad, A. Kulik, H. Shachnai
{"title":"An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP Rounding","authors":"Ilan Doron Arad, A. Kulik, H. Shachnai","doi":"10.4230/LIPIcs.APPROX/RANDOM.2023.22","DOIUrl":"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.22","url":null,"abstract":"We consider the Bin Packing problem with a partition matroid constraint. The input is a set of items of sizes in [0 , 1], and a partition matroid over the items. The goal is to pack the items in a minimum number of unit-size bins, such that each bin forms an independent set in the matroid. This variant of classic Bin Packing has natural applications in secure storage on the Cloud, as well as in equitable scheduling and clustering with fairness constraints. Our main result is an asymptotic fully polynomial-time approximation scheme (AFPTAS) for Bin Packing with a partition matroid constraint. This scheme generalizes the known AFPTAS for Bin Packing with Cardinality Constraints and improves the existing asymptotic polynomial-time approximation scheme (APTAS) for Group Bin Packing, which are both special cases of Bin Packing with partition matroid. We derive the scheme via a new method for rounding a (fractional) solution for a configuration-LP. Our method uses this solution to obtain prototypes , in which items are interpreted as placeholders for other items, and applies fractional grouping to modify a fractional solution (prototype) into one having desired integrality properties","PeriodicalId":54319,"journal":{"name":"Spin","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80102531","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Elimination of Detached Regions in Dependency Graph Verification 依赖图验证中分离区域的消除
IF 1.8 4区 物理与天体物理
Spin Pub Date : 2023-01-01 DOI: 10.1007/978-3-031-32157-3_9
P. G. Jensen, K. Larsen, J. Srba, Nikolaj Jensen Ulrik
{"title":"Elimination of Detached Regions in Dependency Graph Verification","authors":"P. G. Jensen, K. Larsen, J. Srba, Nikolaj Jensen Ulrik","doi":"10.1007/978-3-031-32157-3_9","DOIUrl":"https://doi.org/10.1007/978-3-031-32157-3_9","url":null,"abstract":"","PeriodicalId":54319,"journal":{"name":"Spin","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87003096","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Efficient Trace Generation for Rare-Event Analysis in Chemical Reaction Networks 化学反应网络中稀有事件分析的高效痕量生成
IF 1.8 4区 物理与天体物理
Spin Pub Date : 2023-01-01 DOI: 10.1007/978-3-031-32157-3_5
Bryant Israelsen, Landon Taylor, Zhen Zhang
{"title":"Efficient Trace Generation for Rare-Event Analysis in Chemical Reaction Networks","authors":"Bryant Israelsen, Landon Taylor, Zhen Zhang","doi":"10.1007/978-3-031-32157-3_5","DOIUrl":"https://doi.org/10.1007/978-3-031-32157-3_5","url":null,"abstract":"","PeriodicalId":54319,"journal":{"name":"Spin","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83403902","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Synergy Between Circuit Obfuscation and Circuit Minimization 电路混淆和电路最小化之间的协同作用
IF 1.8 4区 物理与天体物理
Spin Pub Date : 2023-01-01 DOI: 10.4230/LIPIcs.APPROX/RANDOM.2023.31
R. Impagliazzo, Valentine Kabanets, Ilya Volkovich
{"title":"Synergy Between Circuit Obfuscation and Circuit Minimization","authors":"R. Impagliazzo, Valentine Kabanets, Ilya Volkovich","doi":"10.4230/LIPIcs.APPROX/RANDOM.2023.31","DOIUrl":"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.31","url":null,"abstract":"We study close connections between Indistinguishability Obfuscation ( IO ) and the Minimum Circuit Size Problem ( MCSP ), and argue that efficient algorithms/construction for MCSP and IO create a synergy 1 . Some of our main results are: If there exists a perfect (imperfect) IO that is computationally secure against nonuniform polynomial-size circuits, then for all k ∈ N : NP","PeriodicalId":54319,"journal":{"name":"Spin","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83006265","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Approximation Algorithms for Maximum Weighted Throughput on Unrelated Machines 非相关机器上最大加权吞吐量的近似算法
IF 1.8 4区 物理与天体物理
Spin Pub Date : 2023-01-01 DOI: 10.4230/LIPIcs.APPROX/RANDOM.2023.5
George Karakostas, Stavros G. Kolliopoulos
{"title":"Approximation Algorithms for Maximum Weighted Throughput on Unrelated Machines","authors":"George Karakostas, Stavros G. Kolliopoulos","doi":"10.4230/LIPIcs.APPROX/RANDOM.2023.5","DOIUrl":"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.5","url":null,"abstract":"We study the classic weighted maximum throughput problem on unrelated machines. We give a (1 − 1 /e − ε )-approximation algorithm for the preemptive case. To our knowledge this is the first ever approximation result for this problem. It is an immediate consequence of a polynomial-time reduction we design, that uses any ρ -approximation algorithm for the single-machine problem to obtain an approximation factor of (1 − 1 /e ) ρ − ε for the corresponding unrelated-machines problem, for any ε > 0 . On a single machine we present a PTAS for the non-preemptive version of the problem for the special case of a constant number of distinct due dates or distinct release dates. By our reduction this yields an approximation factor of (1 − 1 /e ) − ε for the non-preemptive problem on unrelated machines when there is a constant number of distinct due dates or release dates on each machine.","PeriodicalId":54319,"journal":{"name":"Spin","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77783760","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Probabilistic Metric Embedding via Metric Labeling 基于度量标记的概率度量嵌入
IF 1.8 4区 物理与天体物理
Spin Pub Date : 2023-01-01 DOI: 10.4230/LIPIcs.APPROX/RANDOM.2023.2
Kamesh Munagala, Govind S. Sankar, Erin Taylor
{"title":"Probabilistic Metric Embedding via Metric Labeling","authors":"Kamesh Munagala, Govind S. Sankar, Erin Taylor","doi":"10.4230/LIPIcs.APPROX/RANDOM.2023.2","DOIUrl":"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.2","url":null,"abstract":"We consider probabilistic embedding of metric spaces into ultra-metrics (or equivalently to a constant factor, into hierarchically separated trees) to minimize the expected distortion of any pairwise distance. Such embeddings have been widely used in network design and online algorithms. Our main result is a polynomial time algorithm that approximates the optimal distortion on any instance to within a constant factor. We achieve this via a novel LP formulation that reduces this problem to a probabilistic version of uniform metric labeling.","PeriodicalId":54319,"journal":{"name":"Spin","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78146740","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Approximation Algorithms and Lower Bounds for Graph Burning 图刻录的近似算法和下界
IF 1.8 4区 物理与天体物理
Spin Pub Date : 2023-01-01 DOI: 10.4230/LIPIcs.APPROX/RANDOM.2023.9
Matej Lieskovský, Jirí Sgall, A. Feldmann
{"title":"Approximation Algorithms and Lower Bounds for Graph Burning","authors":"Matej Lieskovský, Jirí Sgall, A. Feldmann","doi":"10.4230/LIPIcs.APPROX/RANDOM.2023.9","DOIUrl":"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.9","url":null,"abstract":"Graph Burning models information spreading in a given graph as a process such that in each step one node is infected (informed) and also the infection spreads to all neighbors of previously infected nodes. Formally, given a graph G = ( V, E ), possibly with edge lengths, the burning number b ( G ) is the minimum number g such that there exist nodes v 0 , . . . , v g − 1 ∈ V satisfying the property that for each u ∈ V there exists i ∈ { 0 , . . . , g − 1 } so that the distance between u and v i is at most i . We present a randomized 2 . 314-approximation algorithm for computing the burning number of a general graph, even with arbitrary edge lengths. We complement this by an approximation lower bound of 2 for the case of equal length edges, and a lower bound of 4 / 3 for the case when edges are restricted to have length 1. This improves on the previous 3-approximation algorithm and an APX-hardness result.","PeriodicalId":54319,"journal":{"name":"Spin","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81954168","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信