1132 search results - page 13 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
ECCC
2008
13 years 6 months ago
2008
TCS
1998
13 years 6 months ago
1998
LOGCOM
2010
13 years 5 months ago
2010
All promiment examples of first-order predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisfiab...
CONCUR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithme...
COLT
2008
Springer
13 years 8 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...