Pages that link to "Item:Q753494"
From MaRDI portal
The following pages link to The complexity of almost linear diophantine problems (Q753494):
Displaying 15 items.
- Quantifier elimination for the reals with a predicate for the powers of two (Q868941) (← links)
- A quantifier-elimination based heuristic for automatically generating inductive assertions for programs (Q882517) (← links)
- Weak quantifier elimination for the full linear theory of the integers (Q945000) (← links)
- Proof synthesis and reflection for linear arithmetic (Q945055) (← links)
- The complexity of linear problems in fields (Q1103602) (← links)
- Presburger liveness verification of discrete timed automata. (Q1874402) (← links)
- A complete and terminating approach to linear integer solving (Q2307624) (← links)
- (Q3115593) (← links)
- Effective Quantifier Elimination for Presburger Arithmetic with Infinity (Q3644100) (← links)
- Lower bounds for solving linear diophantine equations on random access machines (Q3771611) (← links)
- (Q3835450) (← links)
- (Q4361549) (← links)
- (Q4938414) (← links)
- The straight line complexity of small factorials and primorials (Q5246203) (← links)
- Reachability in fixed VASS: expressiveness and lower bounds (Q6629526) (← links)
