The following pages link to Bernd Becker (Q402124):
Displaying 22 items.
- OKFDDs versus OBDDs and OFDDs (Q4645202) (← links)
- ALLQBF Solving by Computational Learning (Q4649309) (← links)
- (Q4677783) (← links)
- (Q4885887) (← links)
- (Q4885894) (← links)
- A Symbiosis of Interval Constraint Propagation and Cylindrical Algebraic Decomposition (Q4928438) (← links)
- Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs (Q4930589) (← links)
- Strategy Synthesis for POMDPs in Robot Planning via Game-Based Abstractions (Q4990151) (← links)
- The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1 (Q5015602) (← links)
- On the relation between BDDs and FDDs (Q5096325) (← links)
- Synthesis for testability: Binary Decision Diagrams (Q5096806) (← links)
- Some remarks on the test complexity of iterative logic arrays (Q5096825) (← links)
- Abstraction-Based Computation of Reward Measures for Markov Automata (Q5172642) (← links)
- Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey (Q5175773) (← links)
- Integration of an LP Solver into Interval Constraint Propagation (Q5199161) (← links)
- Satisfiability checking and symbolic computation (Q5268815) (← links)
- Orthogonal Hypergraph Drawing for Improved Visibility (Q5301385) (← links)
- Theory and Applications of Satisfiability Testing (Q5325881) (← links)
- Cost vs. Time in Stochastic Games and Markov Automata (Q5351873) (← links)
- Experimental and Efficient Algorithms (Q5710044) (← links)
- Verification, Model Checking, and Abstract Interpretation (Q5711504) (← links)
- Theory and Applications of Satisfiability Testing (Q5713738) (← links)
