LCC
13 years 10 months ago
1994 
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...
ORDAL
13 years 10 months ago
1994  COCO
13 years 10 months ago
1994 Springer 
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 ...
ESA
13 years 10 months ago
1994 Springer 
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...
ANTS
13 years 10 months ago
1994 Springer |
Algorithms