8196 search results - page 106 / 1640 » Computational Modeling and Complexity Science |
MFCS
1997
Springer
15 years 2 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
WG
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
106
click to vote
STACS
1994
Springer
15 years 2 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
104
click to vote
FOCS
2008
IEEE
14 years 11 months ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
VRML
2006
ACM
15 years 3 months ago
2006
ACM
Scientists within Geoscience Australia (GA) create complex 3D models of geological structures, using specialised 3D modelling software. Very few people outside GA have access to t...