Search Sciweavers | Sciweavers

29908 search results - page 574 / 5982

» On the Complexity of

178

click to vote

FCT
2001
Springer

109views Applied Computing» more FCT 2001»

The Complexity of Maximum Matroid-Greedoid Intersection

15 years 11 months ago

Download www.cs.helsinki.fi

Abstract. The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown NP-hard by expressing the satisﬁability of boolean formulas in...

Taneli Mielikäinen, Esko Ukkonen

claim paper

Read More »

185

click to vote

FCT
2001
Springer

91views Applied Computing» more FCT 2001»

Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies

15 years 11 months ago

Download vseliv.nspu.ru

We show that some natural reﬁnements of the Straubing and Brzozowski hierarchies correspond (via the so called leaf-languages) step by step to similar reﬁnements of the polynom...

Victor L. Selivanov

claim paper

Read More »

146

click to vote

FOSSACS
2001
Springer

114views Software Engineering» more FOSSACS 2001»

The Complexity of Model Checking Mobile Ambients

15 years 11 months ago

Download www.it.uu.se

Witold Charatonik, Silvano Dal-Zilio, Andrew D. Go...

claim paper