Titlebook: Automata, Languages, and Programming; 39th International C Artur Czumaj,Kurt Mehlhorn,Roger Wattenhofer Conference proceedings 2012 Springe

GUST

書(shū)目名稱(chēng)Automata, Languages, and Programming影響因子(影響力)




書(shū)目名稱(chēng)Automata, Languages, and Programming影響因子(影響力)學(xué)科排名




書(shū)目名稱(chēng)Automata, Languages, and Programming網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)Automata, Languages, and Programming網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)Automata, Languages, and Programming被引頻次




書(shū)目名稱(chēng)Automata, Languages, and Programming被引頻次學(xué)科排名




書(shū)目名稱(chēng)Automata, Languages, and Programming年度引用




書(shū)目名稱(chēng)Automata, Languages, and Programming年度引用學(xué)科排名




書(shū)目名稱(chēng)Automata, Languages, and Programming讀者反饋




書(shū)目名稱(chēng)Automata, Languages, and Programming讀者反饋學(xué)科排名

ALT

采納

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.

會(huì)議

折磨

代理人

MEN

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 minu

accrete

強(qiáng)制令

hematuria

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