Sciweavers

787 search results - page 22 / 158
» Polynomial Constants are Decidable
Sort
View
NA
2007
81views more  NA 2007»
13 years 7 months ago
Positive weight quadrature on the sphere and monotonicities of Jacobi polynomials
In 2000, Reimer proved that a positive weight quadrature rule on the unit sphere Sd ⊂ Rd+1 has the property of quadrature regularity. Hesse and Sloan used a related property, ca...
Paul C. Leopardi
BIRTHDAY
2009
Springer
14 years 2 months ago
Polynomial Precise Interval Analysis Revisited
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...
Thomas Gawlitza, Jérôme Leroux, Jan R...
CATS
2007
13 years 9 months ago
Quantum List Decoding from Quantumly Corrupted Codewords for Classical Block Codes of Polynomially Small Rate
d Abstract) Tomoyuki Yamakami Department of Computer Software, University of Aizu 90 Kami-Iawase, Tsuruga, Ikki-machi, Fukushima 965-8580, Japan Our task of quantum list decoding ...
Tomoyuki Yamakami
ECCC
2011
223views ECommerce» more  ECCC 2011»
13 years 3 months ago
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
FOCS
2008
IEEE
13 years 8 months ago
Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
Nikhil R. Devanur, Ravi Kannan