2430 search results - page 248 / 486 » Computing Tutte Polynomials |
LICS
1997
IEEE
15 years 8 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
130
click to vote
COCO
1989
Springer
15 years 8 months ago
1989
Springer
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
152
click to vote
ACNS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Several researchers have proposed the use of threshold cryptographic model to enable secure communication in ad hoc networks without the need of a trusted center. In this...
116
click to vote
DEXA
2008
Springer
15 years 5 months ago
2008
Springer
Multiple target tracking (MTT) is a well-studied technique in the field of radar technology, which associates anonymized measurements with the appropriate object trajectories. This...
144
click to vote
APVIS
2008
15 years 5 months ago
2008
In the field of Volume Rendering, pre-integration techniques for arbitrary transfer functions has certainly led to the most significant and convincing results both quality and per...