The following pages link to Piotr J. Wojciechowski (Q624349):
Displaying 24 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)
- Lattice-ordered algebras with polynomial inequalities (Q4698492) (← links)
- Read-once refutations in Horn constraint systems: an algorithmic approach (Q5866468) (← links)
- (Q5875680) (← links)
- Reachability in choice networks (Q6108917) (← links)
- Algebraic properties of soluble posets (Q6124432) (← links)
- Reachability problems in interval-constrained and cardinality-constrained graphs (Q6132865) (← links)
- Optimal deterministic controller synthesis from steady-state distributions (Q6156635) (← links)
- Priority-based bin packing with subset constraints (Q6184311) (← links)
