GUST 发表于 2025-3-21 16:19:02
书目名称Automata, Languages, and Programming影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0166235<br><br> <br><br>书目名称Automata, Languages, and Programming影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0166235<br><br> <br><br>书目名称Automata, Languages, and Programming网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0166235<br><br> <br><br>书目名称Automata, Languages, and Programming网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0166235<br><br> <br><br>书目名称Automata, Languages, and Programming被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0166235<br><br> <br><br>书目名称Automata, Languages, and Programming被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0166235<br><br> <br><br>书目名称Automata, Languages, and Programming年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0166235<br><br> <br><br>书目名称Automata, Languages, and Programming年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0166235<br><br> <br><br>书目名称Automata, Languages, and Programming读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0166235<br><br> <br><br>书目名称Automata, Languages, and Programming读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0166235<br><br> <br><br>ALT 发表于 2025-3-21 23:15:34
http://reply.papertrans.cn/17/1663/166235/166235_2.png采纳 发表于 2025-3-22 04:28:36
Quantum Strategies Are Better Than Classical in Almost Any XOR Game More precisely, for large ., the entangled value of a random 2-player XOR game with . questions to every player is at least 1.21... times the classical value, for 1 − .(1) fraction of all 2-player XOR games.会议 发表于 2025-3-22 06:07:50
http://reply.papertrans.cn/17/1663/166235/166235_4.png折磨 发表于 2025-3-22 12:38:46
http://reply.papertrans.cn/17/1663/166235/166235_5.png代理人 发表于 2025-3-22 16:25:14
http://reply.papertrans.cn/17/1663/166235/166235_6.pngMEN 发表于 2025-3-22 20:04:35
Secretary Problems with Convex Costs objective. Requests are presented online in random order, and each request possesses an adversarial value and an adversarial size. The online algorithm must make an irrevocable accept/reject decision as soon as it sees each request. The “profit” of a set of accepted requests is its total value minuaccrete 发表于 2025-3-22 21:14:49
http://reply.papertrans.cn/17/1663/166235/166235_8.png强制令 发表于 2025-3-23 05:15:52
http://reply.papertrans.cn/17/1663/166235/166235_9.pnghematuria 发表于 2025-3-23 09:16:27
On Quadratic Programming with a Ratio Objectivetorial optimization problems, and assuming the Unique Games conjecture, Semidefinite Programming (SDP) techniques give optimal approximation algorithms. We extend this body of work by initiating the study of Quadratic Programming problems where the variables take values in the domain { − 1,0,1}. The