2446 search results - page 68 / 490 » Choiceless Polynomial Time |
CAI
1999
Springer
13 years 7 months ago
1999
Springer
IANDC
1998
13 years 7 months ago
1998
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...
CORR
1999
Springer
13 years 7 months ago
1999
Springer
: We introduce a generalization of Selman's P-selectivity that yields a more exible notion of selectivity, called polynomial-time multi-selectivity, in which the
JSYML
2002
13 years 7 months ago
2002
