Enthought

Kitware

Cool looking <open source EDA tool>[open source EDA toolchain]:
* http://opencircuitdesign.com/qflow/
* https://github.com/RTimothyEdwards/qflow

They apparently even produced a real working small <RISC-V> chip with the flow, not bad.


qflow

{c}
{wiki}

= IRC
{c}
{synonym}
{title2}


Internet Relay Chat

Signal protocol

XMPP

eLife

MDPI

{tag=Protein}
{wiki}

These are apparenty an important part of <transcriptional regulation> given the number of modifications they can undergo! Quite exciting.


Histone

Adenine

Cytosine

Thymine

{title2=U}
{title2=Ura}
{wiki}

Replaces <Thymine> in <RNA>.


Uracil

{c}
{wiki=NP-completeness}

A problem that is both <NP (complexity)> and <NP-hard>.


NP-complete

{c}
{wiki=NP-hardness}

A problem such that all NP problems can be reduced in polynomial time to it.


NP-hard

{c}
{wiki}

This is the most interesting class of problems for <BQP> as we haven't proven that they are neither:
* <P (complexity)>: would be boring on quantum computer
* <NP-complete>: would likely be impossible on a quantum computer

Big list: https://cstheory.stackexchange.com/questions/79/problems-between-p-and-npc/460#460


NP-intermediate

{c}
{wiki}

* https://math.stackexchange.com/questions/361422/why-isnt-np-conp "Why isn't NP = coNP?"
* https://stackoverflow.com/questions/17046440/whats-the-difference-between-np-and-co-np
* https://cs.stackexchange.com/questions/9795/is-the-open-question-np-co-np-the-same-as-p-np
* https://mathoverflow.net/questions/31821/problems-known-to-be-in-both-np-and-conp-but-not-known-to-be-in-p


Co-NP

{c}
{tag=Los Alamos}
{title2=1943-}
{wiki}

\Video[https://www.youtube.com/watch?v=axkQ4UjTc8M]
{title=Historic <Manhattan Project> Sites at <Los Alamos> by <Los Alamos National Lab>}

Historian Alan B. Carr:
* https://www.youtube.com/@AlanBCarr[]. IMPORTANT NOTE: Although Alan B. Carr is a <Los Alamos National Laboratory> (LANL) employee, this page has absolutely no formal connection with LANL.  


Ciro Santilli @cirosantilli  40