920 search results - page 38 / 184 » Generating Satisfiable Problem Instances |
112
click to vote
ATVA
2010
Springer
15 years 27 days ago
2010
Springer
This paper proposes a method for automatically inserting check statements for access control into a given recursive program according to a given security specification. A history-b...
119
click to vote
COCO
2004
Springer
15 years 4 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
111
Voted
ATMOS
2010
14 years 11 months ago
2010
The aim of the train timetabling problem is to find a conflict free timetable for a set of passenger and freight trains along their routes in an infrastructure network. Several ...
132
Voted
SAC
2003
ACM
15 years 6 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
123
Voted
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...