On some path problems on oriented hypergraphs
S. Nguyen, D. Pretolani, L. Markenzon (1998)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Algebraic complexity of path problems”
On some path problems on oriented hypergraphs
Lower bounds on the complexity of real-time branching programs
Klaus Kriegel, Stephan Waack (1988)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On the difficulty of finding walks of length k
S. Basagni, D. Bruschi, F. Ravasio (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On locating a single path-like facility in a general graph
Abraham P. Punnen (1997)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Decomposing a -valued transducer into unambiguous ones
Andreas Weber (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On sets bounded truth-table reducible to -selective sets
Thomas Thierauf, Seinosuke Toda, Osamu Watanabe (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Comparison of the Efficiency of Two Algorithms Which Solve the Shortest Path Problem With an Emotional Agent
Silvana Petruseva (2006)
The Yugoslav Journal of Operations Research
Similarity:
Implementing term rewriting by jungle evaluation
Berthold Hoffmann, Detlef Plump (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: