Sciweavers

1368 search results - page 29 / 274
» Generalized Rook Polynomials
Sort
View
ECCC
2010
79views more  ECCC 2010»
13 years 8 months ago
IP = PSPACE using Error Correcting Codes
The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem ...
Or Meir
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
14 years 3 months ago
Integer Programming: Optimization and Evaluation Are Equivalent
Abstract We show that if one can find the optimal value of an integer programming problem min{cx : Ax ≥ b, x ∈ Zn +} in polynomial time, then one can find an optimal solution...
James B. Orlin, Abraham P. Punnen, Andreas S. Schu...
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
14 years 8 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking
ISSAC
2009
Springer
123views Mathematics» more  ISSAC 2009»
14 years 3 months ago
Schemes for deterministic polynomial factoring
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...
ISTCS
1997
Springer
14 years 20 days ago
An Exact Quantum Polynomial-Time Algorithm for Simon's Problem
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the...
Gilles Brassard, Peter Høyer