Constraint Satisfaction Problems over Numeric Domains (Q4993596): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
label / enlabel / en
 
Constraint Satisfaction Problems over Numeric Domains
Property / DOI
 
Property / DOI: 10.4230/DFU.Vol7.15301.79 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Simplex Algorithms Can Solve Mean Payoff Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Numerical Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Solving Stochastic Games on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4188659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction Problems Solvable by Local Consistency Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The wonderland of reflections / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Max-Atom Problem and Its Relevance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial structure and randomized subexponential algorithms for infinite games / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of Countably Categorical Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-dichotomies in Constraint Satisfaction Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Essential Convexity and Complexity of Semi-Algebraic Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of equality constraint languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of temporal constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint satisfaction tractability from semi-lattice operations on infinite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-Closed Semilinear Constraint Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction Problems over the Integers with Successor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitivity of permutation groups on unordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Solution of Systems of Linear Diophantine Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tropical convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional strategies for mean payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decision Procedure for the First Order Theory of Real Addition with Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential lower bounds for randomized pivoting rules for the simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3245641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case behavior of the steepest edge simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tropical Effective Primary and Dual Nullstellens"atze / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3812077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite representation of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear matrix inequality representation of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable constraints on ordered domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simplex algorithm with the pivot rule of maximizing criterion improvement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal diophantine equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unifying approach to temporal constraint reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of linear constraints over the integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint satisfaction and semilinear expansions of addition over the rationals and the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hilbert's Nullstellensatz is in the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Simultaneous Diophantine Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Games with Perfect Information and Time Average Payoff / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-complete decision problems for binary quadratics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive reducts of real closed fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducts of (C, +, ·) which contain + / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability in reducts of algebraically closed fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4156744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4286756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subexponential bound for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Genuinely Polynomial Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming in Linear Time When the Dimension Is Fixed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with AND/OR Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about temporal relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducts of some structures over the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact duality theory for semidefinite programming and its complexity implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizability of Graphs and Linkages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Representation for Convex Hulls of Real Algebraic Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3423328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming and arithmetic circuit evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5792485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4392286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic games and linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The interior-point revolution in optimization: History, recent developments, and lasting consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean payoff games on graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4230/DFU.Vol7.15301.3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2592282387 / rank
 
Normal rank
Property / title
 
Constraint Satisfaction Problems over Numeric Domains (English)
Property / title: Constraint Satisfaction Problems over Numeric Domains (English) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/DFU.VOL7.15301.79 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:32, 30 December 2024

scientific article; zbMATH DE number 7359808
Language Label Description Also known as
English
Constraint Satisfaction Problems over Numeric Domains
scientific article; zbMATH DE number 7359808

    Statements

    0 references
    0 references
    15 June 2021
    0 references
    constraint satisfaction problems
    0 references
    numerical domains
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Constraint Satisfaction Problems over Numeric Domains (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references