13603 search results - page 94 / 2721 » On the Computational Complexity of Cut-Reduction |
136
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with...
147
click to vote
ENTCS
2008
15 years 6 months ago
2008
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
142
click to vote
JCSS
1998
15 years 5 months ago
1998
We show that all sets that are complete for NP under non-uniform AC0 reductions are isomorphic under non-uniform AC0-computable isomorphisms. Furthermore, these sets remain NP-com...
167
click to vote
TCS
2010
15 years 4 months ago
2010
Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical consistency easily. This paper focus...
233
click to vote
WINE
2010
Springer
15 years 3 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...