Sciweavers

LCC
1994
248views Algorithms» more  LCC 1994»
13 years 10 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
13 years 10 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
ESA
1994
Springer
139views Algorithms» more  ESA 1994»
13 years 10 months ago
A Simple Min Cut Algorithm
We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implemen...
Mechthild Stoer, Frank Wagner
ANTS
1994
Springer
150views Algorithms» more  ANTS 1994»
13 years 10 months ago
Analysis of a left-shift binary GCD algorithm
Jeffrey Shallit, Jonathan Sorenson
Algorithms
Top of PageReset Settings