1445 search results - page 5 / 289 » Uniformly Hard Languages |
ICFP
2005
ACM
14 years 7 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...
CP
2004
Springer
14 years 1 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...
EMNLP
2011
12 years 7 months ago
2011
CORR
2007
Springer
13 years 7 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 ...
IFIP
2009
Springer
14 years 7 days ago
2009
Springer
