Sciweavers

2181 search results - page 36 / 437
» The restriction scaffold problem
Sort
View
COCO
2006
Springer
97views Algorithms» more  COCO 2006»
14 years 11 days ago
Grid Graph Reachability Problems
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
Eric Allender, David A. Mix Barrington, Tanmoy Cha...
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 8 months ago
Pebbling and Branching Programs Solving the Tree Evaluation Problem
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
Dustin Wehr
IPL
2008
65views more  IPL 2008»
13 years 8 months ago
On the fixed-parameter tractability of parameterized model-checking problems
In this note, we show, through the use of examples, how generic results for proving fixed-parameter tractability which apply to restricted classes of structures can sometimes be m...
Iain A. Stewart
JCIT
2008
99views more  JCIT 2008»
13 years 8 months ago
Iterative Operator-Splitting Methods for Stiff Problems in Complex Applications
In this paper we deal with the Landau-LifshitzGilbert equation which describes dynamics of ferromagnetism. Based on the strong nonlinearities a stabilised discretisation method is...
Jürgen Geiser
ICALP
2007
Springer
14 years 2 months ago
Boundedness of Monadic FO over Acyclic Structures
We study the boundedness problem for monadic least fixed points as a decision problem. While this problem is known to be undecidable in general and even for syntactically very res...
Stephan Kreutzer, Martin Otto, Nicole Schweikardt