Sciweavers

1380 search results - page 34 / 276
» A General Polynomial Sieve
Sort
View
DISOPT
2010
132views more  DISOPT 2010»
13 years 8 months ago
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
CDC
2009
IEEE
168views Control Systems» more  CDC 2009»
14 years 1 months ago
Balanced state-space representations: a polynomial algebraic approach
Abstract— We show how to compute a minimal Riccatibalanced state map and a minimal Riccati-balanced state space representation starting from an image representation of a strictly...
Paolo Rapisarda, Harry L. Trentelman
EUROCRYPT
2008
Springer
13 years 10 months ago
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
Predicate encryption is a new paradigm for public-key encryption generalizing, among other things, identity-based encryption. In a predicate encryption scheme, secret keys corresp...
Jonathan Katz, Amit Sahai, Brent Waters
JCT
2011
100views more  JCT 2011»
13 years 3 months ago
On polynomial integrals over the orthogonal group
We consider integrals of type On ua1 11 . . . uan 1nub1 21 . . . ubn 2n du, with respect to the Haar measure on the orthogonal group. We establish several remarkable invariance pro...
Teodor Banica, Benoit Collins, Jean-Marc Schlenker
ICALP
2009
Springer
14 years 9 months ago
On a Network Generalization of the Minmax Theorem
We consider graphical games in which edges are zero-sum games between the endpoints/players; the payoff of a player is the sum of the payoffs from each incident edge. We give a si...
Constantinos Daskalakis, Christos H. Papadimitriou