https://opentcs.cc/https://opentcs.cc/problems/https://opentcs.cc/news/https://opentcs.cc/submit/https://opentcs.cc/about/https://opentcs.cc/problems/3-colorability-of-arrangements-of-great-circles/https://opentcs.cc/problems/3-decomposition-conjecture/https://opentcs.cc/problems/3d-minimum-bend-orthogonal-graph-drawings/https://opentcs.cc/problems/3sum-hard-problems/https://opentcs.cc/problems/a-fixed-point-combinator-from-b-and-mega/https://opentcs.cc/problems/a-streaming-machine-model-for-polyregular-functions/https://opentcs.cc/problems/an-easy-ordinal-assignment-for-typed-terms/https://opentcs.cc/problems/anytime-convergence-rate-of-gradient-descent/https://opentcs.cc/problems/are-context-unification-and-linear-second-order-unification-decidable/https://opentcs.cc/problems/are-the-existential-fragment-or-the-positive-fragment-of-the-theory-of-one-step-rewriting-decidable/https://opentcs.cc/problems/are-there-hyper-recurrent-combinators/https://opentcs.cc/problems/are-universality-and-inclusion-of-ac-recognizable-languages-decidable/https://opentcs.cc/problems/basis-decision-for-proper-combinators/https://opentcs.cc/problems/better-differentially-private-learning-algorithms-with-margin-guarantees/https://opentcs.cc/problems/bi-reachability-in-petri-nets-with-ordered-data/https://opentcs.cc/problems/black-box-reductions-and-adaptive-gradient-methods-for-nonconvex-optimization/https://opentcs.cc/problems/bounds-on-the-length-of-a-coverability-path-in-vass/https://opentcs.cc/problems/bpp-vs-p/https://opentcs.cc/problems/branching-immediate-observation-nets/https://opentcs.cc/problems/bu-chi-automata-using-graph-neural-networks/https://opentcs.cc/problems/can-completion-always-be-made-terminating-when-limiting-the-depth-of-occurrences-of-critical-pairs/https://opentcs.cc/problems/can-local-regularization-learn-all-multiclass-problems/https://opentcs.cc/problems/can-strong-normalization-of-the-typed-lambda-calculus-be-proved-by-a-reasonably-straightforward-mapping-from-typed-terms-to-a-well-founded-ordering/https://opentcs.cc/problems/can-the-application-condition-on-the-merge-rule-in-the-computation-of-dag-solved-forms-of-unification-problems-be-improved/https://opentcs.cc/problems/can-we-use-the-dependency-pair-method-to-prove-relative-termination/https://opentcs.cc/problems/chromatic-number-of-the-plane/https://opentcs.cc/problems/classes-of-languages-with-objective-independent-memory/https://opentcs.cc/problems/collapse-of-the-f-mega-typability-hierarchy/https://opentcs.cc/problems/commutative-polynomial-automata-series/https://opentcs.cc/problems/compatible-triangulations/https://opentcs.cc/problems/complete-techniques-for-deducing-fair-almost-sure-termination/https://opentcs.cc/problems/completing-partial-dfas-to-synchronizing-dfas/https://opentcs.cc/problems/complexity-of-deciding-conjugacy-of-rational-relations/https://opentcs.cc/problems/complexity-of-explorability-games-on-temporal-graphs/https://opentcs.cc/problems/complexity-of-fixed-vas-reachability/https://opentcs.cc/problems/complexity-of-generalised-reachability-games-with-target-sets-of-size-2/https://opentcs.cc/problems/complexity-of-maximising-reachability-for-target-sets-of-size-1/https://opentcs.cc/problems/complexity-of-reachability-in-fixed-dimensional-continuous-vass/https://opentcs.cc/problems/congruent-partitions-of-polygons/https://opentcs.cc/problems/constructive-zermelo-s-problem/https://opentcs.cc/problems/continuous-reachability-in-ordered-data-vas/https://opentcs.cc/problems/continuously-complete-cpo-models-with-minimal-theory/https://opentcs.cc/problems/convergence-of-single-timescale-mean-field-langevin-descent-ascent-for-two-player-zero-sum-games/https://opentcs.cc/problems/counting-polyominoes/https://opentcs.cc/problems/coverability-in-wait-only-networks-with-non-blocking-bounded-sendings/https://opentcs.cc/problems/data-selection-for-regression-tasks/https://opentcs.cc/problems/decidability-of-weighted-automata-determinization/https://opentcs.cc/problems/decidability-of-subtype-entailment/https://opentcs.cc/problems/deciding-upperboundedness-of-z-ccra/https://opentcs.cc/problems/design-a-framework-for-combining-constraint-solving-algorithms/https://opentcs.cc/problems/design-a-notion-of-automata-for-graphs/https://opentcs.cc/problems/design-new-termination-methods-based-on-the-gap-embedding-theorems-of-friedman-and-kriz/https://opentcs.cc/problems/design-pattern-matching-algorithms-for-graphs/https://opentcs.cc/problems/deterministic-separability-of-nondeterministic-timed-languages/https://opentcs.cc/problems/develop-effective-methods-to-decide-whether-a-system-decreases-with-respect-to-some-exponential-interpretation/https://opentcs.cc/problems/direct-sums-in-learning-theory/https://opentcs.cc/problems/distances-among-point-sets-in-r-2-and-r-3/https://opentcs.cc/problems/do-probabilities-matter-for-resolving-nondeterminism/https://opentcs.cc/problems/do-you-pay-for-privacy-in-online-learning/https://opentcs.cc/problems/does-a-min-wa-preserve-reg-by-inverse-image/https://opentcs.cc/problems/does-a-system-that-is-nonoverlapping-under-unification-with-infinite-terms-have-unique-normal-forms/https://opentcs.cc/problems/does-ac-unification-terminate-under-more-flexible-control/https://opentcs.cc/problems/does-differential-privacy-make-pac-learning-much-harder/https://opentcs.cc/problems/does-every-automatic-group-have-a-presentation-through-some-finite-convergent-string-rewriting-system-does-every-automatic-monoid-have-an-automatic-structure-such-that-the-set-of-representatives-is-a-prefix-closed-cross-section/https://opentcs.cc/problems/does-surjective-pairing-conservatively-extend-conversion/https://opentcs.cc/problems/does-the-church-rosser-property-of-abstract-reduction-systems-imply-decreasing-church-rosser/https://opentcs.cc/problems/does-there-exist-a-semigroup-theory-for-which-there-is-a-reduced-canonical-term-rewriting-system-that-is-not-length-decreasing/https://opentcs.cc/problems/dynamic-planar-nearest-neighbors/https://opentcs.cc/problems/edge-coloring-geometric-graphs/https://opentcs.cc/problems/edge-unfolding-convex-polyhedra/https://opentcs.cc/problems/edge-unfolding-polycubes/https://opentcs.cc/problems/efficient-lrs-evaluation/https://opentcs.cc/problems/emptiness-checking-for-3-clock-timed-automata-with-additive-constraints/https://opentcs.cc/problems/equational-axiomatization-of-graph-operations/https://opentcs.cc/problems/equiprojective-polyhedra/https://opentcs.cc/problems/equivalence-of-cost-register-automata-the-quest-for-decidability/https://opentcs.cc/problems/equivalent-k-hd-ta-for-a-given-1-nta/https://opentcs.cc/problems/euclidean-minimum-spanning-tree/https://opentcs.cc/problems/eventual-non-negativity-of-matrices/https://opentcs.cc/problems/existence-of-a-universal-amplifier-of-selection/https://opentcs.cc/problems/expansion-postponement-for-pure-type-systems/https://opentcs.cc/problems/matrix-multiplication-exponent/https://opentcs.cc/problems/extend-combination-results-on-rewrite-orderings-to-systems-involving-reductions/https://opentcs.cc/problems/extending-asynchronous-subtyping-for-binary-session-types/https://opentcs.cc/problems/extending-pseudosegment-arrangements-by-subdivision/https://opentcs.cc/problems/fair-partitioning-of-convex-polygons/https://opentcs.cc/problems/fast-l-1-difference-3b724921/https://opentcs.cc/problems/find-an-embedding-theorem-for-directed-graphs/https://opentcs.cc/problems/find-more-restrictive-strategies-in-boolean-ring-based-methods-for-resolution-like-first-order-theorem-proving/https://opentcs.cc/problems/fine-grained-complexity-for-vas-boundedness/https://opentcs.cc/problems/fine-grained-complexity-of-language-emptiness-for-deterministic-pda/https://opentcs.cc/problems/fine-grained-complexity-of-omega-automata-inclusion/https://opentcs.cc/problems/fine-grained-complexity-of-reachability-in-one-counter-automata/https://opentcs.cc/problems/finite-time-instance-dependent-optimality-for-online-learning-with-feedback-graphs/https://opentcs.cc/problems/fixed-parameter-tractability-of-zonotope-problems/https://opentcs.cc/problems/flip-graph-connectivity-in-3d/https://opentcs.cc/problems/for-which-equational-theories-is-ground-reducibility-of-extended-rewriting-decidable/https://opentcs.cc/problems/freeze-tag-optimal-strategies-for-awakening-a-swarm-of-robots/https://opentcs.cc/problems/from-two-way-to-one-way-transducers-revisited/https://opentcs.cc/problems/functions-weakly-computable-by-vector-addition-systems/https://opentcs.cc/problems/games-under-delays-and-loss/https://opentcs.cc/problems/general-unfoldings-of-nonconvex-polyhedra/https://opentcs.cc/problems/give-a-complete-resource-free-characterisation-of-rewrite-systems-with-polynomial-derivational-complexity/https://opentcs.cc/problems/give-a-definition-of-graph-transduction-that-extends-rational-word-transductions/https://opentcs.cc/problems/give-decidable-criteria-for-left-linear-rewriting-systems-to-be-church-rosser/https://opentcs.cc/problems/good-games-for-good-for-games-automata/https://opentcs.cc/problems/graph-isomorphism-complexity/https://opentcs.cc/problems/hamiltonian-tetrahedralizations/https://opentcs.cc/problems/has-any-full-finitely-generated-and-church-rosser-term-rewriting-system-or-system-with-bound-variables-a-recursive-one-step-normalizing-reduction-strategy/https://opentcs.cc/problems/higher-order-matching-with-many-atoms/https://opentcs.cc/problems/how-can-termination-orderings-for-term-rewriting-be-adapted-to-cover-those-cases-in-which-graph-rewriting-is-terminating-although-term-rewriting-is-not/https://opentcs.cc/problems/how-can-the-notion-of-well-rewrite-ordering-be-used-to-as-the-basis-for-some-new-kind-of-recursive-path-ordering/https://opentcs.cc/problems/how-is-a-1-1-a/https://opentcs.cc/problems/how-much-overparameterization-is-needed-for-als-in-tensor-decomposition/https://opentcs.cc/problems/how-to-compute-finite-and-complete-sets-of-unifiers-for-any-finitary-unification-problem-of-a-syntactic-equational-theory/https://opentcs.cc/problems/hyperltl-satisfiability/https://opentcs.cc/problems/in-combinatory-logic-is-there-a-uniform-universal-generator/https://opentcs.cc/problems/in-the-calculus-which-sets-have-the-form-q-pm/https://opentcs.cc/problems/increasing-unbounded-simple-components/https://opentcs.cc/problems/inhabitation-for-intersection-type-systems/https://opentcs.cc/problems/intersection-type-equations-preserving-normalization/https://opentcs.cc/problems/investigate-confluence-and-termination-of-combinations-of-typed-lambda-calculi-with-term-rewriting-systems/https://opentcs.cc/problems/investigate-normalization-by-a-canonical-term-rewrite-system-in-the-setting-of-second-order-monadic-logic/https://opentcs.cc/problems/investigate-the-exact-difference-between-linear-constant-restrictions-and-arbitrary-constant-restrictions-in-unification-problems/https://opentcs.cc/problems/investigate-the-properties-of-spectri-for-special-classes-of-rewrite-systems/https://opentcs.cc/problems/is-a-certain-conditional-rewrite-system-which-is-a-linearization-of-combinatory-logic-extended-with-surjective-pairing-confluent/https://opentcs.cc/problems/is-any-strongly-non-overlapping-right-linear-term-rewriting-system-confluent/https://opentcs.cc/problems/is-confluence-of-ordered-rewriting-decidable-when-the-existential-fragment-of-the-ordering-is/https://opentcs.cc/problems/is-higher-order-matching-decidable/https://opentcs.cc/problems/is-interaction-necessary-for-order-optimal-1-bit-mean-estimation/https://opentcs.cc/problems/is-it-true-for-non-orthogonal-systems-that-decreasing-redexes-implies-termination-if-not-can-some-decent-subclasses-be-delineated-for-which-the-implication-does-hold/https://opentcs.cc/problems/is-left-sequentiality-a-decidable-property-of-orthogonal-systems/https://opentcs.cc/problems/is-markov-reachability-problem-skolem-hard-for-ergodic-markov-chains/https://opentcs.cc/problems/is-satisfiability-of-lpo-or-rpo-ordering-constraints-decidable-in-case-of-non-total-precedences/https://opentcs.cc/problems/is-strong-sequentiality-decidable-for-arbitrary-rewrite-systems/https://opentcs.cc/problems/is-termination-of-one-linear-rule-decidable/https://opentcs.cc/problems/is-the-decidability-of-strong-sequentiality-for-orthogonal-term-rewriting-systems-np-complete/https://opentcs.cc/problems/is-the-extension-of-combinatory-logic-by-boolean-constants-confluent/https://opentcs.cc/problems/is-the-hierarchy-of-valence-systems-with-open-reachability-proper/https://opentcs.cc/problems/is-the-power-of-deep-learning-over-linear-models-inherently-distribution-dependent/https://opentcs.cc/problems/is-the-satisfiablity-of-ordering-constraints-lpo-in-conjunction-with-predicates-like-irreducibility-by-a-fixed-rewrite-system-or-membership-in-a-regular-tree-language-decidable/https://opentcs.cc/problems/is-the-system-of-cohen-and-watson-for-arithmetic-terminating/https://opentcs.cc/problems/is-the-union-of-two-totally-terminating-rewrite-systems-which-do-not-share-any-symbols-totally-terminating/https://opentcs.cc/problems/is-the-word-problem-for-all-proper-combinators-of-order-smaller-than-3-decidable/https://opentcs.cc/problems/is-the-word-problem-for-the-s-combinator-decidable/https://opentcs.cc/problems/is-there-a-calculus-of-explicit-substitution-that-is-confluent-on-open-terms-simulates-one-step-beta-reduction-and-preserves-beta-strong-normalization/https://opentcs.cc/problems/is-there-a-convergent-extended-rewrite-system-for-ternary-boolean-algebra-in-which-certain-equations-hold/https://opentcs.cc/problems/is-there-a-decidable-uniform-word-problem-for-which-there-is-no-variant-on-the-rewriting-theme-that-can-decide-it-without-adding-new-symbols/https://opentcs.cc/problems/is-there-a-finite-term-rewriting-system-of-some-kind-for-free-lattices/https://opentcs.cc/problems/is-there-a-first-order-method-that-only-converges-to-local-minimax-optima/https://opentcs.cc/problems/is-there-a-notion-of-complete-theory-for-which-contextual-deduction-is-complete-for-refutation-of-ground-clauses/https://opentcs.cc/problems/is-there-a-one-rule-string-rewriting-system-that-is-non-terminating-but-also-non-looping/https://opentcs.cc/problems/is-unification-modulo-the-theory-of-allegories-decidable/https://opentcs.cc/problems/is-unification-of-patterns-modulo-any-set-of-variable-preserving-equations-decidable/https://opentcs.cc/problems/k-sets/https://opentcs.cc/problems/l-vs-nl/https://opentcs.cc/problems/language-equivalence-between-nondeterministic-and-deterministic-one-counter-machines/https://opentcs.cc/problems/learning-1-dta/https://opentcs.cc/problems/learning-sequences/https://opentcs.cc/problems/learning-sparse-linear-concepts-by-priming-the-features/https://opentcs.cc/problems/left-quotient-operator-on-regular-expressions/https://opentcs.cc/problems/linear-loop-synthesis-when-d-variables-are-not-enough/https://opentcs.cc/problems/linear-programming-strongly-polynomial/https://opentcs.cc/problems/linear-volume-3d-grid-drawings-of-planar-graphs/https://opentcs.cc/problems/lines-tangent-to-four-unit-balls/https://opentcs.cc/problems/logic-and-automata-for-multiply-nested-words/https://opentcs.cc/problems/logical-characterisation-of-deterministic-bu-chi-register-automata/https://opentcs.cc/problems/lower-bounds-for-determinizability-of-weighted-automata-over-q/https://opentcs.cc/problems/lower-bound-for-the-decision-of-guidability/https://opentcs.cc/problems/maximality-of-equality-with-finite-sums/https://opentcs.cc/problems/membership-in-logical-classes-for-succinct-finite-automata/https://opentcs.cc/problems/membership-in-reversed-partially-ordered-automata/https://opentcs.cc/problems/membership-of-a-coverability-vass-in-fo2/https://opentcs.cc/problems/memory-requirements-for-generalized-reachability-games/https://opentcs.cc/problems/memory-requirements-of-subgame-perfect-equilibria-in-reachability-games/https://opentcs.cc/problems/minimality-for-deterministic-suffix-reading-automata/https://opentcs.cc/problems/minimum-euclidean-matching-in-2d/https://opentcs.cc/problems/minimum-link-path-in-2d/https://opentcs.cc/problems/monochromatic-triangles/https://opentcs.cc/problems/monotone-regular-functions/https://opentcs.cc/problems/most-circular-partition-of-a-square/https://opentcs.cc/problems/normal-closure-equivalence-of-raag-and-counter-automata/https://opentcs.cc/problems/o-n-2-time-algorithm-for-coverability-in-1-vass/https://opentcs.cc/problems/on-an-equivalence-between-finitely-many-tokens-and-one-invisible-token/https://opentcs.cc/problems/on-unambiguous-grammars/https://opentcs.cc/problems/one-step-strategies-in-lambda-calculus/https://opentcs.cc/problems/online-optimization-of-piecewise-lipschitz-functions/https://opentcs.cc/problems/optimal-best-arm-identification-with-fixed-budget/https://opentcs.cc/problems/optimal-instance-dependent-sample-complexity-for-two-player-zero-sum-games/https://opentcs.cc/problems/optimal-rates-for-stochastic-decision-theoretic-online-learning-under-differential-privacy/https://opentcs.cc/problems/order-optimal-regret-bounds-for-kernel-based-reinforcement-learning/https://opentcs.cc/problems/output-sensitive-convex-hull-in-r-d/https://opentcs.cc/problems/p-vs-np/https://opentcs.cc/problems/p-vs-pspace/https://opentcs.cc/problems/paired-counter-automata/https://opentcs.cc/problems/pallet-loading/https://opentcs.cc/problems/permissive-strategies-for-reachability-games/https://opentcs.cc/problems/planar-euclidean-maximum-tsp/https://opentcs.cc/problems/point-location-in-3d-subdivision/https://opentcs.cc/problems/polygonal-curve-simplification/https://opentcs.cc/problems/polyhedral-surface-approximation/https://opentcs.cc/problems/polyhedron-with-regular-pentagon-faces/https://opentcs.cc/problems/polynomial-linearly-convergent-method-for-geodesically-convex-optimization/https://opentcs.cc/problems/populations-of-markov-decision-processes-what-we-know-and-an-open-question/https://opentcs.cc/problems/positional-nash-equilibria/https://opentcs.cc/problems/positive-recursive-types-versus-system-f-mega/https://opentcs.cc/problems/prime-docas/https://opentcs.cc/problems/properly-learning-decision-trees-in-polynomial-time/https://opentcs.cc/problems/properties-of-the-value-function-in-weighted-timed-games/https://opentcs.cc/problems/quantiles-908c1500/https://opentcs.cc/problems/quantum-pcp/https://opentcs.cc/problems/queue-number-of-planar-graphs/https://opentcs.cc/problems/reachability-for-bounded-branching-vass/https://opentcs.cc/problems/reachability-in-low-dimensional-vass/https://opentcs.cc/problems/reachability-in-reversible-data-vass/https://opentcs.cc/problems/reachability-problem-for-thin-1-gvass/https://opentcs.cc/problems/reconfigurable-broadcast-networks-rbn/https://opentcs.cc/problems/rectangling-a-rectangle/https://opentcs.cc/problems/recursive-types-in-system-f/https://opentcs.cc/problems/reflexivity-of-point-sets/https://opentcs.cc/problems/regret-bounds-for-noise-free-kernel-based-bandits/https://opentcs.cc/problems/regret-minimization-in-heavy-tailed-bandits-with-unknown-moment-parameters/https://opentcs.cc/problems/regular-antichain-subset-of-the-iteration-of-a-regular-language/https://opentcs.cc/problems/relative-degree-for-rational-series/https://opentcs.cc/problems/rolling-a-die-over-a-labeled-board/https://opentcs.cc/problems/running-time-complexity-of-accelerated-1-regularized-pagerank/https://opentcs.cc/problems/safeltl/https://opentcs.cc/problems/satisfiability-of-string-constraints-with-subsequence-relation/https://opentcs.cc/problems/semilinearity-of-2-bvass-backward-reachability-set/https://opentcs.cc/problems/separating-words-problem/https://opentcs.cc/problems/shortest-runs-in-3-d-vass/https://opentcs.cc/problems/simple-linear-time-polygon-triangulation/https://opentcs.cc/problems/simple-polygonalizations/https://opentcs.cc/problems/simulation-decidability-in-gap-order-constraint-systems/https://opentcs.cc/problems/smallest-universal-set-of-points-for-planar-graphs/https://opentcs.cc/problems/sorting-x-y-pairwise-sums/https://opentcs.cc/problems/speed-of-victory-in-adversarial-population-games/https://opentcs.cc/problems/stratified-polymorphic-typability/https://opentcs.cc/problems/strong-exponential-time-hypothesis/https://opentcs.cc/problems/strong-subgame-perfect-equilibria/https://opentcs.cc/problems/structure-agnostic-minimax-risk-for-partial-linear-models/https://opentcs.cc/problems/succinctness-of-gfg-pushdown-automata/https://opentcs.cc/problems/sum-of-square-roots/https://opentcs.cc/problems/np-circuit-lower-bounds/https://opentcs.cc/problems/surface-reconstruction/https://opentcs.cc/problems/target-for-pushdown-rbn/https://opentcs.cc/problems/target-in-asynchronous-shared-memory-systems/https://opentcs.cc/problems/the-busy-beaver-problem-for-population-protocols/https://opentcs.cc/problems/the-equational-meaning-of-deeds/https://opentcs.cc/problems/the-n-factor-in-local-glivenko-cantelli/https://opentcs.cc/problems/the-number-of-fixed-points-of-a-combinator/https://opentcs.cc/problems/the-number-of-pointed-pseudotriangulations/https://opentcs.cc/problems/the-parity-language/https://opentcs.cc/problems/the-sample-complexity-of-multi-distribution-learning/https://opentcs.cc/problems/the-sequential-flow-problem/https://opentcs.cc/problems/the-time-complexity-of-coverability-in-unary-1-vass/https://opentcs.cc/problems/the-word-problem-below-order-three/https://opentcs.cc/problems/thrackles/https://opentcs.cc/problems/tight-characterization-of-instance-optimal-identity-testing/https://opentcs.cc/problems/tighten-the-complexity-of-solving-random-turn-games/https://opentcs.cc/problems/transformation-monoid-minimisation/https://opentcs.cc/problems/transforming-polygons-via-vertex-centroid-moves/https://opentcs.cc/problems/trapping-light-rays-with-segment-mirrors/https://opentcs.cc/problems/traveling-salesman-problem-in-solid-grid-graphs/https://opentcs.cc/problems/tree-automata-with-constraints-on-infinite-trees/https://opentcs.cc/problems/tree-representations-of-contextual-equivalence/https://opentcs.cc/problems/under-what-conditions-does-confluence-of-a-normal-semi-equational-conditional-term-rewriting-system-imply-confluence-of-the-associated-oriented-system/https://opentcs.cc/problems/uniform-universal-generators/https://opentcs.cc/problems/union-of-fat-objects-in-3d/https://opentcs.cc/problems/unique-games-conjecture/https://opentcs.cc/problems/universal-coverability-for-orthant-vas/https://opentcs.cc/problems/universal-positivity-set/https://opentcs.cc/problems/universality-for-unambiguous-automata/https://opentcs.cc/problems/universality-of-letter-bounded-cfls/https://opentcs.cc/problems/variants-of-one-counter-systems-universality/https://opentcs.cc/problems/vertex-pi-floodlights/https://opentcs.cc/problems/vertex-unfolding-polyhedra/https://opentcs.cc/problems/vertical-decompositions-in-r-d/https://opentcs.cc/problems/visibility-graph-recognition/https://opentcs.cc/problems/volume-maximizing-convex-shape/https://opentcs.cc/problems/voronoi-diagram-of-lines-in-3d/https://opentcs.cc/problems/weak-validation-of-tree-languages-by-extended-automata/https://opentcs.cc/problems/weak-versus-strong-normalization-for-pure-type-systems/https://opentcs.cc/problems/what-are-sufficient-condition-for-the-modularity-of-confluence/https://opentcs.cc/problems/what-are-the-complexities-of-various-term-ordering-decision-problems/https://opentcs.cc/problems/what-is-the-complexity-of-joint-differential-privacy-in-linear-contextual-bandits-f7af6dac/https://opentcs.cc/problems/what-is-the-complexity-of-joint-differential-privacy-in-linear-contextual-bandits/https://opentcs.cc/problems/what-is-the-exact-complexity-of-word-unification/https://opentcs.cc/problems/what-is-the-syntactic-type-of-mid-three-way-distributivity/https://opentcs.cc/problems/what-sufficient-conditions-make-confluence-of-general-hyper-graph-rewriting-decidable/https://opentcs.cc/problems/which-conditional-rewrite-systems-are-subcommutative/https://opentcs.cc/problems/which-is-the-coarsest-relation-such-that-its-union-with-any-rewrite-relation-preserves-termination/https://opentcs.cc/problems/which-ordinals-correspond-to-reduction-graphs-in-the-calculus/https://opentcs.cc/problems/which-rewrite-systems-can-be-directly-defined-in-lambda-calculus/https://opentcs.cc/problems/yao-yao-graph-a-spanner/https://opentcs.cc/problems/zipper-unfoldings-of-convex-polyhedra/https://opentcs.cc/news/elliptic-curve-rank-30/https://opentcs.cc/news/lyapunov-symmetric-maximizer-counterexample/https://opentcs.cc/news/random-fast-dynamo/https://opentcs.cc/news/van-der-waerden-lower-bound/https://opentcs.cc/news/yau-tian-donaldson-counterexample/https://opentcs.cc/news/linear-centered-coloring-separation/https://opentcs.cc/news/mini-batch-last-iterate-counterexample/https://opentcs.cc/news/rademacher-fourth-moment-geometry/https://opentcs.cc/news/riesz-dimension-free-weak-type/https://opentcs.cc/news/sato-weak-f-equivalence-counterexamples/https://opentcs.cc/news/weak-simplex-equality-cases/https://opentcs.cc/news/bgp246-lean-formalization/https://opentcs.cc/news/chudnovsky-demailly-conjectures/https://opentcs.cc/news/kahler-volume-comparison/https://opentcs.cc/news/positive-primitive-form-products/https://opentcs.cc/news/lp-subspace-embedding-lower-bound/https://opentcs.cc/news/three-block-admm-identity-counterexample/https://opentcs.cc/news/zeta-simple-critical-line/https://opentcs.cc/news/borsuk-dimension-63/https://opentcs.cc/news/finite-poset-gaps/https://opentcs.cc/news/markovity-conjecture-counterexamples/https://opentcs.cc/news/unbounded-variation-elliptic-equations/https://opentcs.cc/news/hadamard-order-668/https://opentcs.cc/news/nonmetric-lamplighter-spectral-triples/https://opentcs.cc/news/sendov-conjecture-ai-proof/https://opentcs.cc/news/seymour-dense-case/https://opentcs.cc/news/stepsize-acceleration-lower-bound/https://opentcs.cc/news/unsplittable-flow-bounds/https://opentcs.cc/news/approximately-dominating-sets/https://opentcs.cc/news/crouzeix-conjecture-ai-proof/https://opentcs.cc/news/fourier-alignment-counterexample/https://opentcs.cc/news/gapped-consecutive-ones-np-complete/https://opentcs.cc/news/grothendieck-constant-bounds/https://opentcs.cc/news/optimal-agnostic-pac/https://opentcs.cc/news/planar-facial-distance-patterns/https://opentcs.cc/news/planar-spin-systems/https://opentcs.cc/news/ai-assisted-zero-capacity-quantum-channel/https://opentcs.cc/news/ai-pipeline-nine-open-problems/https://opentcs.cc/news/greedy-optimal-semi-streaming-matching/https://opentcs.cc/news/openai-planar-unit-distance-counterexample/https://opentcs.cc/news/splay-trees-almost-dynamically-optimal/https://opentcs.cc/news/openai-first-proof-submissions/https://opentcs.cc/news/gemini-imo-2025/https://opentcs.cc/news/alphaevolve-matrix-multiplication/