1795 search results - page 100 / 359 » On the Complexity of Circuit Satisfiability |
177
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—The differential encoding/decoding setup introduced by Kiran et al, Oggier-Hassibi and Jing-Jafarkhani for wireless relay networks that use codebooks consisting of unitary matri...
188
click to vote
IJCGA
2010
15 years 4 months ago
2010
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
204
click to vote
DISOPT
2011
15 years 28 days ago
2011
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
173
click to vote
MP
2011
15 years 25 days ago
2011
We perform a smoothed analysis of Renegar’s condition number for linear programming by analyzing the distribution of the distance to ill-posedness of a linear program subject to...
162
click to vote
COCO
1995
Springer
15 years 9 months ago
1995
Springer
Over a decade ago, Schoning introduced the concept of lowness into structural complexity theory. Since then a large body of results has been obtained classifying various complexit...