BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
graph (2)
allow (2)
tape (1)
orient (1)
simul (1)

Stem nontrivi$ (all stems)

5 papers:

STOCSTOC-2010-DellM #polynomial #satisfiability
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses (HD, DvM), pp. 251–260.
WCREWCRE-2005-TrifuK #object-oriented
Capturing Nontrivial Concerns in Object-Oriented Software (MT, VK), pp. 99–108.
STOCSTOC-2005-Hastad #approximate
Every 2-CSP allows nontrivial approximation (JH), pp. 740–746.
CSLCSL-1990-Ranaivoson #bound #graph #problem
Nontrivial Lower Bounds for some NP-Problems on Directed Graphs (SR), pp. 318–339.
STOCSTOC-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.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.