1199 search results - page 138 / 240 » Parameterized Proof Complexity |
SMI
2005
IEEE
14 years 2 months ago
2005
IEEE
We present an approach to hierarchically encode the topology of functions over triangulated surfaces. We describe the topology of a function by its Morse-Smale complex, a well kno...
STOC
2004
ACM
14 years 9 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
BMCBI
2007
13 years 9 months ago
2007
Background: In structural genomics, an important goal is the detection and classification of protein–protein interactions, given the structures of the interacting partners. We h...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
CIE
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...