232 results on '"Szeider, Stefan"'
Search Results
2. CSP beyond tractable constraint languages
3. SAT backdoors: Depth beats size
4. Are hitting formulas hard for resolution?
5. Computing optimal hypertree decompositions with SAT
6. New width parameters for SAT and #SAT
7. SAT Modulo Symmetries for Graph Generation and Enumeration.
8. SAT-based Decision Tree Learning for Large Data Sets.
9. The Silent (R)evolution of SAT.
10. Meta-kernelization using well-structured modulators
11. Long-Distance Q-Resolution with Dependency Schemes
12. The treewidth of proofs
13. SAT-boosted Tabu Search for Coloring Massive Graphs.
14. Co-Certificate Learning with SAT Modulo Symmetries
15. Quantified conjunctive queries on partially ordered sets
16. Soundness of Q-resolution with dependency schemes
17. Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees
18. Parameterized and subexponential-time complexity of satisfiability problems and applications
19. On finding optimal polytrees
20. Backdoors to tractable answer set programming
21. Solving Problems on Graphs of High Rank-Width
22. Guarantees and limits of preprocessing in constraint satisfaction and reasoning
23. On Upward-Planar L-Drawings of Graphs
24. Model Counting for CNF Formulas of Bounded Modular Treewidth
25. Quantifier Reordering for QBF
26. Backdoors to q-Horn
27. Satisfiability of acyclic and almost acyclic CNF formulas
28. SAT Backdoors: Depth Beats Size
29. Augmenting tractable fragments of abstract argumentation
30. A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
31. Short Q-Resolution Proofs with Homomorphisms
32. Finding a Cluster in Incomplete Data
33. A SAT Attack on Rota’s Basis Conjecture
34. Front Matter, Table of Contents, Preface, Conference Organization
35. CSP Beyond Tractable Constraint Languages
36. The parameterized complexity of [formula omitted]-flip local search for SAT and MAX SAT
37. On the complexity of some colorful problems parameterized by treewidth
38. Algorithms and complexity results for persuasive argumentation
39. A SAT Approach to Twin-Width
40. Certified DQBF Solving by Definition Extraction
41. Covering graphs with few complete bipartite subgraphs
42. Formalizing Graph Trail Properties in Isabelle/HOL
43. ALGORITHMIC APPLICATIONS OF TREE-CUT WIDTH.
44. SAT Modulo Symmetries for Graph Generation
45. Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming
46. Solving MAX-r-SAT Above a Tight Lower Bound
47. Parameterized Proof Complexity
48. Tractable cases of the extended global cardinality constraint
49. Backdoor Sets of Quantified Boolean Formulas
50. Parameterized SAT : 2003; Szeider 2003; Szeider
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.