2446 search results - page 139 / 490 » Choiceless Polynomial Time |
178
click to vote
INFOCOM
2003
IEEE
16 years 2 days ago
2003
IEEE
Abstract— Efficient bandwidth allocation strategy with simultaneous fulfillment of QoS requirement of a user in a mobile cellular network is still a critical and an important p...
190
click to vote
APCCAS
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper considers z-domain transfer functions whose denominator polynomial possesses the property that the coefficient of zi is greater than the coefficient of zi-1 . Such trans...
196
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
188
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
176
click to vote
ECAI
2010
Springer
15 years 4 months ago
2010
Springer
We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all mi...