11345 search results - page 1736 / 2269 » Foundations of Computer Science |
154
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
143
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...
144
click to vote
DM
2008
15 years 6 months ago
2008
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoreti...
177
click to vote
EOR
2010
15 years 6 months ago
2010
We propose a modified alternate direction method for solving convex quadratically constrained quadratic semidefinite optimization problems. The method is a first-order method, the...