On quantified linear implications (Q2254606): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10472-013-9332-3 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10472-013-9332-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049924983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithm for multiparametric linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: QEPCAD B / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real quantifier elimination is doubly exponential / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complexity perspective on entailment of parameterized linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specification, validation, and synthesis of email agent controllers: A case study in function rich reactive system design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4391452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of parametric linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient solving of quantified inequality constraints over the real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typing Linear Constraints for Moding CLP( ${\cal R}$ ) Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of partially Clairvoyant scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of totally clairvoyant scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a decision procedure for quantified linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alfred Tarski's elimination theory for real closed fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of linear problems in fields / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10472-013-9332-3 / rank
 
Normal rank

Latest revision as of 16:56, 17 December 2024

scientific article
Language Label Description Also known as
English
On quantified linear implications
scientific article

    Statements

    On quantified linear implications (English)
    0 references
    5 February 2015
    0 references
    quantified linear implication
    0 references
    linear constraints
    0 references
    inclusion query over polyhedral sets
    0 references
    computational complexity
    0 references
    polynomial hierarchy
    0 references
    0 references
    0 references
    0 references

    Identifiers