GeoBase - Geospatial Engine

General GIS terms
Terms that are on used on this site.

You can always search for entries (regexp permitted).
Begins with Contains Exactly matches		View Glossary Submit Term
All \| E \| G \| L \| N \| P \| R \| S \| T \| V
N
There are 1 entries in the glossary.
Pages: 1
Term	Definition
NP-Hard	In computational complexity theory, NP-hard (Non-deterministic Polynomial-time hard) refers to the class containing all problems H, such that for every decision problem L in NP there exists a polynomial-time many-one reduction to H, written $L \leq_p H$ .

All \| E \| G \| L \| N \| P \| R \| S \| T \| V
Glossary V2.0