Sciweavers

1322 search results - page 98 / 265
» Parameterized counting problems
Sort
View
CDC
2009
IEEE
137views Control Systems» more  CDC 2009»
14 years 1 months ago
Important moments in systems, control and optimization
— The moment problem matured from its various special forms in the late 19th and early 20th Centuries to a general class of problems that continues to exert profound influence o...
Christopher I. Byrnes, Anders Lindquist
BMCBI
2006
141views more  BMCBI 2006»
13 years 9 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings
CJTCS
1999
133views more  CJTCS 1999»
13 years 8 months ago
The Permanent Requires Large Uniform Threshold Circuits
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
Eric Allender
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
11 years 11 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
JUCS
2010
117views more  JUCS 2010»
13 years 7 months ago
NP-completeness and FPT Results for Rectilinear Covering Problems
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
Vladimir Estivill-Castro, Apichat Heednacram, Fran...