Piotr J. Wojciechowski

From MaRDI portal
Person:624349

Available identifiers

zbMath Open wojciechowski.piotr-jMaRDI QIDQ624349

List of research outcomes

PublicationDate of PublicationType
Algebraic properties of soluble posets2024-03-27Paper
Priority-based bin packing with subset constraints2024-01-24Paper
The octatope abstract domain for verification of neural networks2023-08-17Paper
A faster algorithm for determining the linear feasibility of systems of BTVPI constraints2023-08-14Paper
On the parallel complexity of constrained read-once refutations in UTVPI constraint systems2023-08-04Paper
Reachability problems in interval-constrained and cardinality-constrained graphs2023-07-15Paper
Reachability in choice networks2023-06-30Paper
Optimal deterministic controller synthesis from steady-state distributions2023-06-14Paper
On the approximability of path and cycle problems in arc-dependent networks2023-05-08Paper
Integer feasibility and refutations in UTVPI constraints using bit-scaling2023-02-16Paper
https://portal.mardi4nfdi.de/entity/Q58756802023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q50529962022-11-25Paper
Read-once refutations in Horn constraint systems: an algorithmic approach2022-09-22Paper
Analyzing the reachability problem in choice networks2022-08-30Paper
https://portal.mardi4nfdi.de/entity/Q50915352022-07-26Paper
Exact and parameterized algorithms for read-once refutations in Horn constraint systems2022-07-01Paper
Analyzing read-once cutting plane proofs in Horn systems2022-06-09Paper
On the complexity of and solutions to the minimum stopping and trapping set problems2022-05-31Paper
Transitive systems and conclusive partial orders2022-04-20Paper
Algorithmic analysis of priority-based bin packing2022-03-24Paper
On the copy complexity of width 3 Horn constraint systems2022-03-24Paper
Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas2022-02-14Paper
Analyzing unit read-once refutations in difference constraint systems2021-12-01Paper
Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints2021-10-21Paper
Copy complexity of Horn formulas with respect to unit read-once resolution2021-10-21Paper
Tree-like unit refutations in Horn constraint systems2021-10-04Paper
On finding shortest paths in arc-dependent networks2021-02-04Paper
NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability2021-01-07Paper
Analyzing fractional Horn constraint systems2020-10-21Paper
Optimal length tree-like refutations of linear feasibility in UTVPI constraints2020-07-07Paper
Restricted cutting plane proofs in Horn constraint systems2020-05-13Paper
Read-once certification of linear infeasibility in UTVPI constraints2019-10-15Paper
Read-once resolutions in Horn formulas2019-10-11Paper
The Complexity of Finding Read-Once NAE-Resolution Refutations2019-07-24Paper
Full algebras of matrices2019-07-03Paper
A fully polynomial time approximation scheme for refutations in weighted difference constraint systems2018-06-05Paper
Finding read-once resolution refutations in systems of 2CNF clauses2018-05-17Paper
A certifying algorithm for lattice point feasibility in a system of UTVPI constraints2018-03-01Paper
On a generalization of Horn constraint systems2017-08-22Paper
Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic2017-07-19Paper
On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas2017-05-19Paper
A combinatorial certifying algorithm for linear feasibility in UTVPI constraints2017-05-11Paper
Analyzing restricted fragments of the theory of linear arithmetic2017-03-06Paper
A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints2016-09-29Paper
An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints2016-05-03Paper
Compositional Bisimulation Minimization for Interval Markov Decision Processes2016-04-13Paper
A Graphical Theorem of the Alternative for UTVPI Constraints2016-02-25Paper
On quantified linear implications2015-02-05Paper
A complexity perspective on entailment of parameterized linear constraints2015-01-22Paper
Feasible algorithms for lattice and directed subspaces2015-01-16Paper
Signature matrix algebras and bipartite graphs2014-06-03Paper
On the complexity of quantified linear systems2014-01-13Paper
On the Additivity of the Minkowski Functionals2013-07-30Paper
https://portal.mardi4nfdi.de/entity/Q48997702013-01-09Paper
https://portal.mardi4nfdi.de/entity/Q53892772012-04-26Paper
Matrix algebras with multiplicative decomposition property2011-02-09Paper
Equivalents for a quasivariety to be generated by a single structure2009-03-17Paper
Embeddings of totally ordered MV-algebras of bounded cardinality2009-03-16Paper
Large-Scale Scientific Computing2007-11-15Paper
Multiplicative bases in matrix algebras2007-02-14Paper
Ordinal Explanation of the Periodic System of Chemical Elements2006-05-19Paper
Lattice orders on matrix algebras.2005-04-19Paper
Directed maximal partial orders of matrices.2003-12-04Paper
A proof of Weinberg’s conjecture on lattice-ordered matrix algebras2002-06-17Paper
\(F^*\)-rings are \(O^*\)2000-12-19Paper
Strict Archimedean \(t\)-norms and \(t\)-conorms as universal approximators2000-01-04Paper
On lattice extensions of partial orders of rings1998-04-26Paper
https://portal.mardi4nfdi.de/entity/Q43588261997-10-01Paper
https://portal.mardi4nfdi.de/entity/Q48869601997-02-24Paper
Images of bilinear mappings into 𝐑³1996-12-10Paper
Orderpotent \(f\)-rings1996-02-08Paper
Lattice-ordered algebras with polynomial inequalities1995-06-11Paper
Archimedean orderpotent rings1994-08-22Paper
https://portal.mardi4nfdi.de/entity/Q31423851993-12-09Paper
https://portal.mardi4nfdi.de/entity/Q34900541989-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Piotr J. Wojciechowski