📚 node [[np]]

NP

  • class of languages whose membership proofs can be verified in polynomial time
  • the [[discrete-log]] problem is an example of an NP problem
    • from $g^x$ in a finite field it is hard to compute $\log_g\left(g^x\right)$, but easy to check $g^x = g^y$ to validate a knowledge proof of $x$
📖 stoas
⥱ context
⥅ related node [[pioneers settlers townplanners]]
⥅ related node [[2004 05 18 darwinports]]
⥅ related node [[2005 02 07 no lnp in canada equals no competition]]
⥅ related node [[2007 06 23 microsoft expression launch event at canvas lounge with gk vanpatter and silverlight]]
⥅ related node [[2007 08 22 third tuesday attended yesterday npost is today]]
⥅ related node [[2008 03 14 npr interview with bill gates on the microsoft vancouver dev center]]
⥅ related node [[penpen]]
⥅ related node [[3np]]
⥅ related node [[jigme rinpoche]]
⥅ related node [[lama jigme rinpoche]]
⥅ related node [[open letter to jigme rinpoche]]
⥅ related node [[phanpy]]
⥅ related node [[roamanpub]]
⥅ related node [[shamanpunk]]
⥅ related node [[input_function]]
⥅ related node [[input_layer]]
⥅ related node [[gdp vs gnp]]
⥅ related node [[uxnpkg]]
⥅ related node [[automatic commonplace to agora]]
⥅ related node [[commonplace books]]
⥅ related node [[cs unplugged]]
⥅ related node [[hyper commonplace garden wiki]]
⥅ related node [[long read review k punk the collected and unpublished writings of mark fisher 2004 2016]]
⥅ related node [[lumpenproletariat]]
⥅ related node [[my commonplace moodboard]]
⥅ related node [[nonprofits should almost never write their own software]]
⥅ related node [[setting up commonplace locally on tablet]]
⥅ related node [[smalltalk and commonplace books]]
⥅ related node [[worker self directed nonprofit]]
⥅ related node [[20210318213618 input_output_tables]]
⥅ related node [[np complete]]
⥅ related node [[np hard]]
⥅ related node [[nonprofit funding]]
⥅ related node [[xi jinping]]