612 search results - page 20 / 123 » Hardness assumptions in the foundations of theoretical compu... |
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
This paper deals with balanced leaf language complexity classes, introduced independently in [1] and [14]. We propose the seed concept for leaf languages, which allows us to give ...
ITICSE
2006
ACM
14 years 1 months ago
2006
ACM
Often Software Engineering courses approach educating undergraduates in good processes and practices by using a simulated product development environment, following all of the ste...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...