2233 search results - page 174 / 447 » On the Complexity of Theory Curbing |
204
click to vote
ACID
2006
15 years 7 months ago
2006
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...
159
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
In the first part, we introduce binary representations of both lambda calculus and combinatory logic terms, and demonstrate their simplicity by providing very compact parser-inter...
138
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
Mundici considered the question of whether the interpolant of two propositional formulas of the form F G can always have a short circuit description, and showed that if this is t...
168
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equation. ...
170
click to vote
SIGACT
2008
15 years 6 months ago
2008
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...