scientific article; zbMATH DE number 2079387
From MaRDI portal
zbMath1092.68716MaRDI QIDQ4471346
Alberto Policriti, Carla Piazza, Raffaella Gentilini
Publication date: 28 July 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Randomized OBDD-based graph algorithms, Computing bottom SCCs symbolically using transition guided reduction, An efficient algorithm for computing bisimulation equivalence, Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations, Lower bounds on the OBDD size of two fundamental functions' graphs, On the OBDD representation of some graph classes, Randomized OBDD-Based Graph Algorithms, Exponential space complexity for OBDD-based reachability analysis, New results on the most significant bit of integer multiplication, On symbolic OBDD-based algorithms for the minimum spanning tree problem, On efficient implicit OBDD-based algorithms for maximal matchings, Implicit computation of maximum bipartite matchings by sublinear functional operations, Symbolic coloured SCC decomposition, Symbolic graphs: Linear solutions to connectivity related problems, Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components, Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives, The Quest for a Tight Translation of Büchi to co-Büchi Automata, Larger lower bounds on the OBDD complexity of integer multiplication, A note on the size of OBDDs for the graph of integer multiplication, On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem, On the size of (generalized) OBDDs for threshold functions, Unnamed Item, An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps, Compositional SCC analysis for language emptiness, Automata-Theoretic Model Checking Revisited, Larger Lower Bounds on the OBDD Complexity of Integer Multiplication, On the OBDD size for graphs of bounded tree- and clique-width, From complementation to certification
Uses Software
