Sciweavers

2681 search results - page 83 / 537
» Problem F
Sort
View
FSEN
2009
Springer
14 years 4 months ago
The Complexity of Reachability in Randomized Sabotage Games
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...
Dominik Klein, Frank G. Radmacher, Wolfgang Thomas
TPHOL
1992
IEEE
14 years 2 months ago
The HOL Logic Extended with Quantification over Type Variables
The HOL system is an LCF-style mechanized proof-assistant for conducting proofs in higher order logic. This paper discusses a proposal to extend the primitive basis of the logic un...
Thomas F. Melham
SIAMCOMP
2008
84views more  SIAMCOMP 2008»
13 years 10 months ago
Resolution Is Not Automatizable Unless W[P] Is Tractable
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
Michael Alekhnovich, Alexander A. Razborov
EMMCVPR
1999
Springer
14 years 2 months ago
A New Algorithm for Energy Minimization with Discontinuities
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we conside...
Yuri Boykov, Olga Veksler, Ramin Zabih
STOC
2006
ACM
107views Algorithms» more  STOC 2006»
14 years 10 months ago
On basing one-way functions on NP-hardness
We consider the possibility of basing one-way functions on NP-Hardness; that is, we study possible reductions from a worst-case decision problem to the task of average-case invert...
Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana...