## Stem solvabl$ (all stems)

### 22 papers:

- DATE-2015-FuggerNNS #modelling #physics #towards
- Towards binary circuit models that faithfully capture physical solvability (MF, RN, TN, US), pp. 1455–1460.
- LICS-2015-GasconTS #polynomial #problem #unification
- One Context Unification Problems Solvable in Polynomial Time (AG, AT, MSS), pp. 499–510.
- FoSSaCS-2014-CarraroG #call-by #semantics
- A Semantical and Operational Account of Call-by-Value Solvability (AC, GG), pp. 103–118.
- FLOPS-2012-AccattoliP #call-by #revisited
- Call-by-Value Solvability, Revisited (BA, LP), pp. 4–16.
- FoSSaCS-2010-PaganiR #λ-calculus
- Solvability in Resource λ-Calculus (MP, SRDR), pp. 358–373.
- LATA-2010-LetichevskySS #automaton #equivalence #finite #multi #problem #proving #using
- The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape (AAL, ASS, SKS), pp. 392–402.
- ICML-2010-KrishnamurthyT
- Inverse Optimal Control with Linearly-Solvable MDPs (KD, ET), pp. 335–342.
- LATA-2009-BehleKR
- Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG] (CB, AK, SR), pp. 129–140.
- TACAS-2008-Kovacs #algebra #reasoning
- Reasoning Algebraically About P-Solvable Loops (LK), pp. 249–264.
- SMT-2007-ConchonCKL08 #congruence #semantics
- CC(X): Semantic Combination of Congruence Closure with Solvable Theories (SC, EC, JK, SL), pp. 51–69.
- ICALP-2005-Kayal #equation #finite #polynomial
- Solvability of a System of Bivariate Polynomial Equations over a Finite Field (NK), pp. 551–562.
- TACAS-2004-SuW #analysis #constraints
- A Class of Polynomially Solvable Range Constraints for Interval Analysis without Widenings and Narrowings (ZS, DW), pp. 280–295.
- ICALP-2003-XieDI #equation #infinity #polynomial #verification
- A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State Systems (GX, ZD, OHI), pp. 668–680.
- STOC-2001-MostefaouiRR #distributed
- Conditions on input vectors for consensus solvability in asynchronous distributed systems (AM, SR, MR), pp. 153–162.
- STOC-2001-Watrous #algorithm #quantum
- Quantum algorithms for solvable groups (JW), pp. 60–67.
- ICALP-2001-DiekertM #commutative #decidability #equation
- Solvability of Equations in Free Partially Commutative Groups Is Decidable (VD, AM), pp. 543–554.
- CADE-1999-Schmidt-SchaussS #decidability #equation
- Solvability of Context Equations with Two Context Variables is Decidable (MSS, KUS), pp. 67–81.
- SLP-1985-SawamuraT85 #optimisation #prolog #recursion
- Recursive Unsolvability of Determinacy, Solvable Cases of Determinancy and their Applications to Prolog Optimization (HS, TT), pp. 200–207.
- STOC-1983-LandauM #polynomial
- Solvability by Radicals is in Polynomial Time (SL, GLM), pp. 140–151.
- GG-1982-Schnitzler #graph #morphism #problem
- The isomorphism problem is polynomially solvable for certain graph languages (MS), pp. 369–379.
- ICALP-1979-Therien
- Languages of Nilpotent and Solvable Groups (Extended Abstract) (DT), pp. 616–632.
- STOC-1976-IbarraK #problem
- A Useful Device for Showing the Solvability of Some Decision Problems (OHI, CEK), pp. 135–140.