1920 search results - page 64 / 384 » The Complexity of the A B C Problem |
153
click to vote
AAAI
1998
15 years 7 months ago
1998
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
139
click to vote
GC
2010
Springer
15 years 4 months ago
2010
Springer
A new class of polyhedra is discovered—bipyramids of arbitrarily prescribed genus. A two-dimensional generalization of Fáry’s Theorem is established. A purely combinatorial de...
190
Voted
CCR
2006
15 years 6 months ago
2006
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
139
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a net...
145
click to vote
COCO
1995
Springer
15 years 9 months ago
1995
Springer
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...