Pages that link to "Item:Q1159661"

The following pages link to The complexity of logical theories (Q1159661):

Displaying 50 items.

• On the complexity of quantified linear systems (Q391791) (← links)
• Analyzing restricted fragments of the theory of linear arithmetic (Q513354) (← links)
• Exact complexity bounds for ordinal addition (Q671516) (← links)
• The complexity of one-agent refinement modal logic (Q744988) (← links)
• The complexity of almost linear diophantine problems (Q753494) (← links)
• Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories (Q793017) (← links)
• Deciding Boolean algebra with Presburger arithmetic (Q861705) (← links)
• A mathematical framework for the semantics of symbolic languages representing periodic time (Q862832) (← links)
• Computational complexity of logical theories of one successor and another unary function (Q868664) (← links)
• A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
• Weak quantifier elimination for the full linear theory of the integers (Q945000) (← links)
• Proof synthesis and reflection for linear arithmetic (Q945055) (← links)
• Real addition and the polynomial hierarchy (Q1063589) (← links)
• On the complexity of theories of permutations (Q1088647) (← links)
• The complexity of elementary algebra and geometry (Q1096620) (← links)
• The complexity of linear problems in fields (Q1103602) (← links)
• A bibliography of quantifier elimination for real closed fields (Q1103610) (← links)
• Subclasses of Presburger arithmetic and the polynomial-time hierarchy (Q1115858) (← links)
• Dominoes and the complexity of subclasses of logical theories (Q1115859) (← links)
• Complexity, convexity and combinations of theories (Q1141138) (← links)
• On time-space classes and their relation to the theory of real addition (Q1155607) (← links)
• The complexity of Presburger arithmetic with bounded quantifier alternation depth (Q1163534) (← links)
• Complexity of logical theories involving coprimality (Q1202924) (← links)
• Complexity of Presburger arithmetic with fixed quantifier dimension (Q1361890) (← links)
• The complexity of query evaluation in indefinite temporal constraint databases (Q1369238) (← links)
• A canonical form of vector machines (Q1383713) (← links)
• Well-abstracted transition systems: Application to FIFO automata. (Q1401924) (← links)
• Linear problems in valued fields (Q1582303) (← links)
• Real computations with fake numbers (Q1599196) (← links)
• Solving quantified linear arithmetic by counterexample-guided instantiation (Q1688537) (← links)
• A logic for reasoning about probabilities (Q1813497) (← links)
• Probabilistic game automata (Q1824400) (← links)
• The complexity of verifying population protocols (Q2025857) (← links)
• Towards efficient verification of population protocols (Q2058386) (← links)
• Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages (Q2163995) (← links)
• Emptiness problems for integer circuits (Q2182324) (← links)
• A complete and terminating approach to linear integer solving (Q2307624) (← links)
• Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic'' (Q2364369) (← links)
• Equivalence between model-checking flat counter systems and Presburger arithmetic (Q2636509) (← links)
• Alternating complexity of counting first-order logic for the subword order (Q2687036) (← links)
• Colors Make Theories Hard (Q2817916) (← links)
• Double-exponential inseparability of Robinson subsystem <i>Q</i>₊ (Q3083130) (← links)
• The role of rudimentary relations in complexity theory (Q3347299) (← links)
• More about Exact Slow $k$-Nim (Q3390058) (← links)
• Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic (Q3447697) (← links)
• SAFE RECURSIVE SET FUNCTIONS (Q3450802) (← links)
• WORD EQUATIONS OVER GRAPH PRODUCTS (Q3521473) (← links)
• Classifying the computational complexity of problems (Q3781088) (← links)
• Presburger arithmetic with unary predicates is <i>Π</i>₁¹ complete (Q3984438) (← links)
• On the complexity of team logic and its two-variable fragment (Q5005127) (← links)