24 search results - page 2 / 5 » mfcs 2010 |
MFCS
2010
Springer
13 years 3 months ago
2010
Springer
MFCS
2010
Springer
13 years 3 months ago
2010
Springer
We provide a strong normalization result for MLF , a type system generalizing ML with first-class polymorphism as in system F. The proof is achieved by translating MLF into a calc...
MFCS
2010
Springer
13 years 3 months ago
2010
Springer
A reduction system for regular expressions is presented. For a regular expression t, the reduction system is proved to terminate in a state where the most-reduced expression readil...
MFCS
2010
Springer
13 years 3 months ago
2010
Springer
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...
MFCS
2010
Springer
13 years 3 months ago
2010
Springer
Karchmer, Kushilevitz and Nisan formulated the formula size problem as an integer programming problem called the rectangle bound and introduced a technique called the LP bound, whi...