scientific article; zbMATH DE number 3029852
From MaRDI portal
zbMath0018.38601MaRDI QIDQ5769706
Publication date: 1938
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Narrow Proofs May Be Maximally Long, Proof complexity of modal resolution, A note about \(k\)-DNF resolution, Polynomial-time inference of all valid implications for Horn and related formulae, Logical analysis of data -- the vision of Peter L. Hammer, On propositional definability, Strong ETH and resolution via games and the multiplicity of strategies, A general method for deciding about logically constrained issues, Boolean function metrics can assist modelers to check and choose logical rules, On CDCL-Based Proof Systems with the Ordered Decision Strategy, Rough sets: past, present, and future, Resolution lower bounds for the weak functional pigeonhole principle., On connected Boolean functions, Prominent classes of the most general subsumptive solutions of Boolean equations, McColl and Minimization, Comprehensive vs. comprehensible classifiers in logical analysis of data, Spanned patterns for the logical analysis of data, Consensus algorithms for the generation of all maximal bicliques, Space proof complexity for random 3-CNFs, Unnamed Item, A Framework for Space Complexity in Algebraic Proof Systems, Nullstellensatz size-degree trade-offs from reversible pebbling, Parameterized Complexity of DPLL Search Procedures, Supercritical Space-Width Trade-offs for Resolution, Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers, Boolean function minimization in the class of disjunctive normal forms, Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search, Convexity and logical analysis of data, Nullstellensatz size-degree trade-offs from reversible pebbling, MaxSAT Resolution and Subcube Sums, Group cancellation and resolution
