1445 search results - page 5 / 289 » Uniformly Hard Languages |
147
click to vote
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
138
click to vote
CP
2004
Springer
15 years 9 months ago
2004
Springer
It is well known that the ratio of the number of clauses to the number of variables in a random k-SAT instance is highly correlated with the instance’s empirical hardness. We con...
184
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
88
Voted
IFIP
2009
Springer
15 years 8 months ago
2009
Springer
