The following pages link to Piotr J. Wojciechowski (Q624349):
Displaying 50 items.
- (Q391790) (redirect page) (← links)
- (Q777308) (redirect page) (← links)
- (Q1005981) (redirect page) (← links)
- On the complexity of quantified linear systems (Q391791) (← links)
- A complexity perspective on entailment of parameterized linear constraints (Q487646) (← links)
- Analyzing restricted fragments of the theory of linear arithmetic (Q513354) (← links)
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints (Q527418) (← links)
- Matrix algebras with multiplicative decomposition property (Q624350) (← links)
- Optimal length tree-like refutations of linear feasibility in UTVPI constraints (Q777309) (← links)
- Algorithmic analysis of priority-based bin packing (Q831745) (← links)
- On the copy complexity of width 3 Horn constraint systems (Q831922) (← links)
- Multiplicative bases in matrix algebras (Q865393) (← links)
- Equivalents for a quasivariety to be generated by a single structure (Q1005982) (← links)
- Directed maximal partial orders of matrices. (Q1414693) (← links)
- \(F^*\)-rings are \(O^*\) (Q1590176) (← links)
- A certifying algorithm for lattice point feasibility in a system of UTVPI constraints (Q1702822) (← links)
- Finding read-once resolution refutations in systems of 2CNF clauses (Q1749535) (← links)
- Lattice orders on matrix algebras. (Q1771928) (← links)
- Strict Archimedean \(t\)-norms and \(t\)-conorms as universal approximators (Q1818109) (← links)
- Orderpotent \(f\)-rings (Q1905998) (← links)
- Analyzing unit read-once refutations in difference constraint systems (Q2055789) (← links)
- Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas (Q2075363) (← links)
- Transitive systems and conclusive partial orders (Q2127616) (← links)
- On the complexity of and solutions to the minimum stopping and trapping set problems (Q2143118) (← links)
- Exact and parameterized algorithms for read-once refutations in Horn constraint systems (Q2151419) (← links)
- Analyzing the reachability problem in choice networks (Q2170221) (← links)
- Restricted cutting plane proofs in Horn constraint systems (Q2180223) (← links)
- Analyzing fractional Horn constraint systems (Q2205946) (← links)
- On finding shortest paths in arc-dependent networks (Q2225067) (← links)
- Tree-like unit refutations in Horn constraint systems (Q2232285) (← links)
- Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints (Q2235285) (← links)
- Copy complexity of Horn formulas with respect to unit read-once resolution (Q2235734) (← links)
- On quantified linear implications (Q2254606) (← links)
- Read-once resolutions in Horn formulas (Q2327091) (← links)
- Read-once certification of linear infeasibility in UTVPI constraints (Q2327508) (← links)
- Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic'' (Q2364369) (← links)
- On a generalization of Horn constraint systems (Q2399383) (← links)
- Signature matrix algebras and bipartite graphs (Q2451205) (← links)
- A fully polynomial time approximation scheme for refutations in weighted difference constraint systems (Q2636553) (← links)
- Analyzing read-once cutting plane proofs in Horn systems (Q2673307) (← links)
- Integer feasibility and refutations in UTVPI constraints using bit-scaling (Q2684489) (← links)
- A Graphical Theorem of the Alternative for UTVPI Constraints (Q2787434) (← links)
- Compositional Bisimulation Minimization for Interval Markov Decision Processes (Q2798714) (← links)
- An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints (Q2803820) (← links)
- A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints (Q2819515) (← links)
- On the Additivity of the Minkowski Functionals (Q2841918) (← links)
- Feasible algorithms for lattice and directed subspaces (Q2938997) (← links)
- On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas (Q2988835) (← links)
- Archimedean orderpotent rings (Q3141935) (← links)
- (Q3142385) (← links)
- NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability (Q3386749) (← links)
- Lattice-ordered algebras with polynomial inequalities (Q4698492) (← links)
