The following pages link to Leibniz (Q24795):
Displayed 34 items.
- Oriented hypergraphs: introduction and balance (Q396889) (← links)
- A logic-based approach to polymer sequence analysis (Q655183) (← links)
- Ideal clutters (Q697573) (← links)
- A characterization of oriented hypergraphic balance via signed weak walks (Q745211) (← links)
- Solving peptide sequencing as satisfiability (Q929155) (← links)
- New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability (Q937398) (← links)
- Approximating minimal unsatisfiable subformulae by means of adaptive core search (Q1408373) (← links)
- A satisfiability procedure for quantified Boolean formulae (Q1408385) (← links)
- Some interesting research directions in satisfiability (Q1601833) (← links)
- On functional dependencies in \(q\)-Horn theories (Q1606330) (← links)
- Algebraic and dynamical cancellations associated to spectral sequence (Q1677186) (← links)
- On exact selection of minimally unsatisfiable subformulae (Q1777390) (← links)
- Probability logic and optimization SAT: The PSAT and CPA models (Q1777404) (← links)
- A complete adaptive algorithm for propositional satisfiability (Q1811072) (← links)
- A perspective on certain polynomial-time solvable classes of satisfiability (Q1861558) (← links)
- Implementation of a unimodularity test (Q1947200) (← links)
- Special issues on The satisfiability problem (pp. 1--244) including papers from the 1st workshop on satisfiability, Certosa di Pontignano, Italy, April 29--May 3, 1996 and Boolean functions (pp. 245--479) (Q1961443) (← links)
- An algorithm for the class of pure implicational formulas (Q1961448) (← links)
- Oriented hypergraphs: balanceability (Q2124629) (← links)
- Signed-graphic matroids with all-graphic cocircuits (Q2404380) (← links)
- Balanced matrices (Q2433704) (← links)
- (Q2741521) (← links)
- Consistency of the static and dynamic components of object-oriented specifications (Q2778415) (← links)
- A MINSAT Approach for Learning in Logic Domains (Q2884520) (← links)
- (Q3077976) (← links)
- (Q3181641) (← links)
- (Q4375759) (← links)
- (Q5002753) (← links)
- On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes) (Q5009328) (← links)
- Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches (Q5148189) (← links)
- Theory and Applications of Satisfiability Testing (Q5325864) (← links)
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making (Q5463945) (← links)
- Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces (Q5858649) (← links)
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)