The following pages link to (Q4082296):
Displaying 50 items.
- An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic (Q478379) (← links)
- Proving inequalities and solving global optimization problems via simplified CAD projection (Q492036) (← links)
- A class of algorithms which require nonlinear time to maintain disjoint sets (Q598809) (← links)
- Exact complexity bounds for ordinal addition (Q671516) (← links)
- Towards exact geometric computation (Q676577) (← links)
- The complexity of almost linear diophantine problems (Q753494) (← links)
- On the definability of properties of finite graphs (Q791548) (← links)
- Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories (Q793017) (← links)
- Definability and fast quantifier elimination in algebraically closed fields (Q798314) (← links)
- Generic complexity of Presburger arithmetic (Q848747) (← links)
- XML schema, tree logic and sheaves automata (Q862561) (← links)
- Quantifier elimination for the reals with a predicate for the powers of two (Q868941) (← 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)
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals (Q998976) (← links)
- The complexity of elementary algebra and geometry (Q1096620) (← links)
- Computer algebra: Past and future (Q1098287) (← links)
- On the computational complexity of the theory of Abelian groups (Q1100188) (← 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)
- Programming in metric temporal logic (Q1128978) (← links)
- Tautology testing with a generalized matrix reduction method (Q1132862) (← links)
- Complexity, convexity and combinations of theories (Q1141138) (← links)
- The complexity of the equivalence problem for two characterizations of Presburger sets (Q1149429) (← links)
- On time-space classes and their relation to the theory of real addition (Q1155607) (← links)
- Remarks on recursion versus diagonalization and exponentially difficult problems (Q1156483) (← links)
- The complexity of logical theories (Q1159661) (← links)
- The complexity of Presburger arithmetic with bounded quantifier alternation depth (Q1163534) (← links)
- Number of quantifiers is better than number of tape cells (Q1164622) (← links)
- Upper and lower bounds for first order expressibility (Q1173404) (← links)
- Complexity of computations in Commutative Division of the USSR Academy of Sciences (Q1173942) (← links)
- Complexity of logical theories involving coprimality (Q1202924) (← links)
- A universally hard set of formulae with respect to non-deterministic Turing acceptors (Q1236428) (← links)
- Complexity-class-encoding sets (Q1237360) (← links)
- A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic (Q1247317) (← links)
- Complexity of deciding Tarski algebra (Q1264143) (← links)
- On the parallel complexity of the polynomial ideal membership problem (Q1271168) (← links)
- Formulation of linear problems and solution by a universal machine (Q1338141) (← links)
- Complexity of Presburger arithmetic with fixed quantifier dimension (Q1361890) (← links)
- The complexity of query evaluation in indefinite temporal constraint databases (Q1369238) (← links)
- An undecidability theorem for lattices over group rings (Q1377645) (← links)
- Multitree automata that count (Q1770418) (← links)
- A technique for proving decidability of containment and equivalence of linear constraint queries (Q1807671) (← links)
- A logic for reasoning about probabilities (Q1813497) (← links)
- Cancellativity in finitely presented semigroups (Q1824041) (← links)
- Symbolic model checking of timed guarded commands using difference decision diagrams (Q1858438) (← links)
- The max-plus algebra of the natural numbers has no finite equational basis (Q1870591) (← links)
