A novel algorithm is presented that overcomes limitations of existing shadow volume algorithms when dealing with nonmanifold geometry and space partitioning. This simple algorithm...
In the upcoming high transmission rate system, based on code division multiple access, standard multi-user detection methods are restricted because of performance and implementati...
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...
We analyse the computational complexity of phonological models as they have developed over the past twenty years. The major results ate that generation and recognition are undecid...
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...