256 search results - page 42 / 52 » Separation of NP-Completeness Notions |
CRITICAL
2005
14 years 25 days ago
2005
This paper addresses design agendas in Human-Computer Interaction and neighbouring fields motivated by the mixing of areas that were mostly kept separate until recently, such as m...
TCS
2002
13 years 10 months ago
2002
This paper surveys the theoretical developments in the field of stochastic process algebras, process algebras where action occurrences may be subject to a delay that is determined...
BIRTHDAY
2010
Springer
13 years 9 months ago
2010
Springer
m, modules, types and operations), different kinds of abstractions (functional/data, types/objects etc.) without falling into a loose collection of diagram languages. Considering a...
ICA
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. The recovery of the mixture of an N-dimensional signal generated by N independent processes is a well studied problem (see e.g. [1,10]) and robust algorithms that solve t...
FSTTCS
2009
Springer
14 years 5 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...