6568 search results - page 79 / 1314 » Reducing the Complexity of Reductions |
147
click to vote
COCO
2006
Springer
15 years 10 months ago
2006
Springer
We establish a close connection between (sub)exponential time complexity and parameterized complexity by proving that the so-called miniaturization mapping is a reduction preservi...
183
click to vote
NLDB
2005
Springer
16 years 8 days ago
2005
Springer
For most English words, dictionaries give various senses: e.g., “bank” can stand for a financial institution, shore, set, etc. Automatic selection of the sense intended in a gi...
175
click to vote
ACSC
2005
IEEE
16 years 12 days ago
2005
IEEE
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...
167
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
c communication case. This lemma generalizes and abstracts in a very clean form the ``round reduction'' techniques used in many previous lower bound proofs. ] 1998 Academ...
176
click to vote
COCOON
2009
Springer
15 years 7 months ago
2009
Springer
We investigate the question whether NE can be separated from the reduction closures of tally sets, sparse sets and NP. We show that (1) NE RNP no(1)-T (TALLY); (2)NE RSN m (SPARS...