291
click to vote
LCC
15 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...
246
click to vote
LCC
15 years 10 months ago
1994 
We firstly survey several forms of Herbrand's theorem. What is commonly called "Herbrand's theorem" in many textbooks is actually a very simple form of Herbrand...
217
click to vote
STOC
15 years 10 months ago
1994 ACM 
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
|
Algorithms