2957 search results - page 14 / 592 » The Complexity of Polynomial-Time Approximation |
123
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
140
Voted
CSL
2009
Springer
15 years 7 months ago
2009
Springer
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
145
Voted
CORR
2004
Springer
15 years 3 months ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
164
Voted
FOCS
1991
IEEE
15 years 7 months ago
1991
IEEE
For sums of radicals Pk i=1 i di p i, where i; i are elements of some real algebraic number eld Q( ); di p i 2 R; we present a deterministic polynomial time algorithm to decide wh...
135
Voted
CORR
2004
Springer
15 years 3 months ago
2004
Springer
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...