2446 search results - page 56 / 490 » Choiceless Polynomial Time |
ESA
2009
Springer
13 years 11 months ago
2009
Springer
Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
AUSAI
2006
Springer
13 years 11 months ago
2006
Springer
A novel type of higher order pipelined neural network, the polynomial pipelined neural network, is presented. The network is constructed from a number of higher order neural networ...
DISOPT
2007
13 years 7 months ago
2007
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
STOC
1995
ACM
13 years 11 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
An RNA molecule is structured on several layers. The primary and most obvious structure is its sequence of bases, i.e. a word over the alphabet {A, C, G, U}. The higher structure i...