- Embeddability in R3 is NP-hard2018 | Faculty of Mathematics and Physics
- Embeddability in R-3 is NP-hard2020 | Faculty of Mathematics and Physics
- NP-HARDNESS OF COMPUTING PL GEOMETRIC CATEGORY IN DIMENSION2023 | Faculty of Mathematics and Physics
- Subset Synchronizability in Eulerian Automata Is NP-Hard2014 | Faculty of Mathematics and Physics
- IV-matching is strongly NP-hard2017 | Faculty of Mathematics and Physics
- Busygin, Stanislav; Pasechnik, Dmitrii V.: On NP-hardness of the clique partition -- independence number gap recognition and related problems2006 | Faculty of Mathematics and Physics
- Computing the Norm $\|A\|_{\infty,1}$ is NP-Hard2000 | Faculty of Mathematics and Physics
- Linear Programming with Inexact Data is NP-Hard1998 | Faculty of Mathematics and Physics
- Enclosing solutions of linear interval equations is NP-hard1994 | Publication without faculty affiliation
- NP-hardness results for linear algebraic problems with interval data1994 | Publication without faculty affiliation
- Checking bounds on solution of linear interval equations is NP-hard1995 | Publication without faculty affiliation
- The Unbearable Hardness of Unknotting2019 | Faculty of Mathematics and Physics
- The unbearable hardness of unknotting2021 | Faculty of Mathematics and Physics
- Checking positive definiteness or stability of symmetric interval matrices is NP-hard1994 | Publication without faculty affiliation
- When Is Data Processing Under Interval and Fuzzy Uncertainty Feasible: What if Few Inputs Interact? Does Feasibility Depend on How We Describe Interaction?2021 | Faculty of Mathematics and Physics
- Linear Interval Equations: Computing Enclosures with Bounded Relative Overestimation is NP-Hard1996 | Faculty of Mathematics and Physics
- Shellability Is Hard Even for Balls2023 | Faculty of Mathematics and Physics
- Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases2019 | Faculty of Mathematics and Physics
- Optimization of Quadratic Forms and t-norm Forms on Interval Domain and Computational Complexity2021 | Faculty of Mathematics and Physics
- Computing exact componentwise bounds on solutions of linear systems with interval data is NP-hard1995 | Publication without faculty affiliation
- Hardness of embedding simplicial complexes in R^d2011 | Faculty of Mathematics and Physics
- Griddings of Permutations and Hardness of Pattern Matching2021 | Faculty of Mathematics and Physics
- d-collapsibility is NP complete for d greater or equal to 42010 | Faculty of Mathematics and Physics
- Abstract Model of k-Cloud ComputingPublication without faculty affiliation
- The complexity of computation and approximation of the t-ratio over one-dimensional interval data2014 | Faculty of Mathematics and Physics
- COMPLEXITY OF COMPUTING INTERVAL MATRIX POWERS FOR SPECIAL CLASSES OF MATRICES2020 | Faculty of Mathematics and Physics
- Maximization of a convex quadratic form on a polytope: Factorization and the Chebyshev norm bounds2020 | Faculty of Mathematics and Physics
- General Caching Is Hard: Even with Small Pages2017 | Faculty of Mathematics and Physics
- Complexity issues for the symmetric interval eigenvalue problem2015 | Faculty of Mathematics and Physics
- Robust Slater's condition in an uncertain environment2021 | Faculty of Mathematics and Physics