Constraint satisfaction problems over numeric domains
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 3128733 (Why is no real title available?)
- scientific article; zbMATH DE number 4081342 (Why is no real title available?)
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 3466805 (Why is no real title available?)
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 3588048 (Why is no real title available?)
- scientific article; zbMATH DE number 3586989 (Why is no real title available?)
- scientific article; zbMATH DE number 3626518 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 545277 (Why is no real title available?)
- scientific article; zbMATH DE number 1160037 (Why is no real title available?)
- scientific article; zbMATH DE number 3336816 (Why is no real title available?)
- scientific article; zbMATH DE number 3053259 (Why is no real title available?)
- A Decision Procedure for the First Order Theory of Real Addition with Order
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- A new polynomial-time algorithm for linear programming
- A subexponential bound for linear programming
- A subexponential lower bound for Zadeh's pivoting rule for solving linear programs and games
- A unifying approach to temporal constraint reasoning
- Additive reducts of real closed fields
- Algorithms for the Solution of Systems of Linear Diophantine Equations
- An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm
- An exact duality theory for semidefinite programming and its complexity implications
- An exact duality theory for semidefinite programming based on sums of squares
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Circuit satisfiability and constraint satisfaction around Skolem arithmetic
- Closure properties of constraints
- Combinatorial simplex algorithms can solve mean payoff games
- Combinatorial structure and randomized subexponential algorithms for infinite games
- Computational complexity of linear constraints over the integers
- Constraint Satisfaction Problems Solvable by Local Consistency Methods
- Constraint satisfaction and semilinear expansions of addition over the rationals and the reals
- Constraint satisfaction problems over the integers with successor
- Constraint satisfaction tractability from semi-lattice operations on infinite sets
- Cores of Countably Categorical Structures
- Cyclic games and linear programming
- Definability in reducts of algebraically closed fields
- Essential convexity and complexity of semi-algebraic constraints
- Hilbert's Nullstellensatz is in the polynomial hierarchy
- Hilbert's tenth problem. Diophantine classes and extensions to global fields
- Integer Programming with a Fixed Number of Variables
- Intersection graphs of segments
- Introduction to algorithms.
- Linear Programming in Linear Time When the Dimension Is Fixed
- Linear matrix inequality representation of sets
- MAX-closed semilinear constraint satisfaction
- NP-complete decision problems for binary quadratics
- Non-dichotomies in Constraint Satisfaction Complexity
- On the Complexity of Numerical Analysis
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- On the scope of the universal-algebraic approach to constraint satisfaction
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Positional strategies for mean payoff games
- Realizability of graphs and linkages
- Reasoning about temporal relations
- Reducibility among combinatorial problems
- Reducts of (C, +, ·) which contain +
- Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction
- Reducts of some structures over the reals
- Scheduling with AND/OR Precedence Constraints
- Semidefinite Representation for Convex Hulls of Real Algebraic Curves
- Semidefinite programming and arithmetic circuit evaluation
- Semidefinite representation of convex sets
- Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
- Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems
- Stochastic Games with Perfect Information and Time Average Payoff
- Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
- Sufficient and necessary conditions for semidefinite representability of convex hulls and sets
- The Computational Complexity of Simultaneous Diophantine Approximation Problems
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The Max-Atom Problem and Its Relevance
- The algebraic dichotomy conjecture for infinite domain constraint satisfaction problems
- The complexity of equality constraint languages
- The complexity of mean payoff games on graphs
- The complexity of solving stochastic games on graphs
- The complexity of stochastic games
- The complexity of temporal constraint satisfaction problems
- The constraint satisfaction problem and universal algebra
- The interior-point revolution in optimization: History, recent developments, and lasting consequences
- The simplex algorithm with the pivot rule of maximizing criterion improvement
- The wonderland of reflections
- Towards a Genuinely Polynomial Algorithm for Linear Programming
- Tractable constraints on ordered domains
- Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning
- Transitivity of permutation groups on unordered sets
- Tropical convexity
- Tropical effective primary and dual Nullstellensätze
- Universal diophantine equation
- Worst case behavior of the steepest edge simplex method
Cited in
(20)- Constraint Satisfaction Problems on Intervals and Lengths
- Tractability conditions for numeric CSPs
- On classifying continuous constraint satisfaction problems
- Constraint satisfaction and semilinear expansions of addition over the rationals and the reals
- scientific article; zbMATH DE number 7359806 (Why is no real title available?)
- Constraint satisfaction problems over the integers with successor
- Essential convexity and complexity of semi-algebraic constraints
- Affine consistency and the complexity of semilinear constraints
- Algorithms and complexity of difference logic
- A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains
- Symmetries and complexity (invited talk)
- Linear satisfiability preserving assignments
- Analytic constraint solving and interval arithmetic
- Piecewise linear valued constraint satisfaction problems with fixed number of variables
- An application of Farkas' lemma to finite-valued constraint satisfaction problems over infinite domains
- The complexity of valued CSPs
- Semilinear Program Feasibility
- Quantaloidal approach to constraint satisfaction
- \((\mathbb{Z},\mathrm{succ},U)\), \((\mathbb{Z},E,U)\), and their CSP's
- Solving equation systems in ω-categorical algebras
This page was built for publication: Constraint satisfaction problems over numeric domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993596)
