Sciweavers

1383 search results - page 127 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
CSL
2006
Springer
15 years 10 months ago
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic
In a previous work we introduced Dual Light Affine Logic (DLAL) ([BT04]) as a variant of Light Linear Logic suitable for guaranteeing complexity properties on lambda-calculus terms...
Vincent Atassi, Patrick Baillot, Kazushige Terui
COCO
1991
Springer
173views Algorithms» more  COCO 1991»
15 years 10 months ago
On the Random-Self-Reducibility of Complete Sets
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
Joan Feigenbaum, Lance Fortnow
AAAI
2007
15 years 8 months ago
Asymptotically Optimal Encodings of Conformant Planning in QBF
The world is unpredictable, and acting intelligently requires anticipating possible consequences of actions that are taken. Assuming that the actions and the world are determinist...
Jussi Rintanen
AAAI
1990
15 years 7 months ago
Physical Impossibility Instead of Fault Models
In this paper we describe the concept of physical impossibility as an alternative to the specification of fault models. These axioms can be used to exclude impossible diagnoses si...
Gerhard Friedrich, Georg Gottlob, Wolfgang Nejdl
DCG
2008
69views more  DCG 2008»
15 years 6 months ago
On Projections of Semi-Algebraic Sets Defined by Few Quadratic Inequalities
Let S Rk+m be a compact semi-algebraic set defined by P1 0, . . . , P 0, where Pi R[X1, . . . , Xk, Y1, . . . , Ym], and deg(Pi) 2, 1 i . Let denote the standard projection f...
Saugata Basu, Thierry Zell