### 11 papers:

- VLDB-2010-FanLMTWW #graph #pattern matching #polynomial
- Graph Pattern Matching: From Intractable to Polynomial Time (WF, JL, SM, NT, YW, YW), pp. 264–275.
- CSL-2009-Kreutzer #higher-order #logic #monad #on the
- On the Parameterised Intractability of Monadic Second-Order Logic (SK), pp. 348–363.
- ICML-2008-FinleyJ
- Training structural SVMs when exact inference is intractable (TF, TJ), pp. 304–311.
- ICML-2007-DavidsonR #clustering #constraints
- Intractability and clustering with constraints (ID, SSR), pp. 201–208.
- LICS-2004-FlumG #model checking #problem
- Model-Checking Problems as a Basis for Parameterized Intractability (JF, MG), pp. 388–397.
- RTA-1997-Schulz #algorithm
- A Criterion for Intractability of E-unification with Free Function Symbols and Its Relevance for Combination Algorithms (KUS), pp. 284–298.
- STOC-1992-VenkatesanR #matrix #problem
- Average Case Intractability of Matrix and Diophantine Problems (Extended Abstract) (RV, SR), pp. 632–642.
- ML-1990-Flann #abstraction
- Applying Abstraction and Simplification to Learn in Intractable Domains (NSF), pp. 277–285.
- STOC-1988-Ben-OrGKW #how #interactive #multi #proving
- Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions (MBO, SG, JK, AW), pp. 113–131.
- ICLP-1986-Wolfram86 #backtracking #problem
- Intractable Unifiability Problems and Backtracking (DAW), pp. 107–121.
- STOC-1977-AdlemanM
- Reducibility, Randomness, and Intractability (Abstract) (LMA, KLM), pp. 151–163.