5 papers:
STOC-2010-DellM #polynomial #satisfiability- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses (HD, DvM), pp. 251–260.
WCRE-2005-TrifuK #object-oriented- Capturing Nontrivial Concerns in Object-Oriented Software (MT, VK), pp. 99–108.
- STOC-2005-Hastad #approximate
- Every 2-CSP allows nontrivial approximation (JH), pp. 740–746.
CSL-1990-Ranaivoson #bound #graph #problem- Nontrivial Lower Bounds for some NP-Problems on Directed Graphs (SR), pp. 318–339.
- STOC-1986-GalilKS #graph #nondeterminism #on the #simulation #turing machine
- On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines (ZG, RK, ES), pp. 39–49.
