5100 search results - page 273 / 1020 » The Linear Complexity of a Graph |
138
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
150
click to vote
MCS
2000
Springer
15 years 8 months ago
2000
Springer
Abstract Investigating a data set of the critical size makes a classification task difficult. Studying dissimilarity data refers to such a problem, since the number of samples equa...
147
click to vote
VLSID
2002
IEEE
16 years 4 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
142
click to vote
IPPS
2008
IEEE
15 years 10 months ago
2008
IEEE
—The performance bottleneck for many scientific applications is the cost of memory access inside linear algebra kernels. Tuning such kernels for memory efficiency is a complex ...
125
click to vote
PKC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In the CT-track of the 2006 RSA conference, a new multivariate public key cryptosystem, which is called the Medium Field Equation (MFE) multivariate public key cryptosyst...