937 search results - page 90 / 188 » On the Complexity of Partial Order Properties |
123
click to vote
DAM
2006
15 years 6 months ago
2006
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
170
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
172
click to vote
FM
1991
Springer
15 years 9 months ago
1991
Springer
An important goal of software engineering is to exploit commonalities in system design in order to reduce the complexity of building new systems, support largescale reuse, and pro...
161
click to vote
SIAMNUM
2011
15 years 1 months ago
2011
In this paper we prove the discrete compactness property for a wide class of p finite element approximations of non-elliptic variational eigenvalue problems in two and three spac...
154
Voted
CG
2006
Springer
15 years 6 months ago
2006
Springer
The investigation of molecular structures often requires the use of graphics software to display different representations of the molecule of interest. Unfortunately, the commonly...