Derandomization of Sparse Cyclotomic Integer Zero Testing
暂无分享,去创建一个
[1] Zhi-Zhong Chen,et al. Reducing randomness via irrational numbers , 1997, STOC '97.
[2] John N. Tsitsiklis,et al. The Complexity of Optimal Queuing Network Control , 1999, Math. Oper. Res..
[3] Sham M. Kakade,et al. Trading in Markovian Price Models , 2005, COLT.
[4] Ronald L. Graham,et al. Some NP-complete geometric problems , 1976, STOC '76.
[5] Sudipto Guha,et al. Asking the right questions: model-driven optimization using probes , 2006, PODS.
[6] Dimitris Bertsimas,et al. Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic , 2000, Oper. Res..
[7] David A. Plaisted,et al. New NP-hard and NP-complete polynomial and integer divisibility problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[8] P. Whittle. Restless bandits: activity allocation in a changing world , 1988, Journal of Applied Probability.
[9] Jeffrey Shallit,et al. Factor refinement , 1993, SODA '90.
[10] Johannes Blömer,et al. A Probabilistic Zero-Test for Expressions Involving Root of Rational Numbers , 1998, ESA.
[11] Michael Filaseta,et al. On testing the divisibility of lacunary polynomials by cyclotomic polynomials , 2004, Math. Comput..
[12] J. Niño-Mora. RESTLESS BANDITS, PARTIAL CONSERVATION LAWS AND INDEXABILITY , 2001 .
[13] T. Tao. An uncertainty principle for cyclic groups of prime order , 2003, math/0308286.
[14] Manfred K. Warmuth,et al. The Weighted Majority Algorithm , 1994, Inf. Comput..
[15] Peter Bro Miltersen,et al. 2 The Task of a Numerical Analyst , 2022 .
[16] Sudipto Guha,et al. Approximation algorithms for budgeted learning problems , 2007, STOC '07.
[17] Johannes Blömer,et al. A probabilistic zero test for expressions involving roots of rational numbers , 1998 .