Results 141 to 150 of about 312 (179)

Realizing string-net condensation: Fibonacci anyon braiding for universal gates and sampling chromatic polynomials. [PDF]

Nat Commun
Minev ZK, Najafi K, Majumder S, Wang J, Stern A, Kim EA, Jian CM, Zhu G.   +7 more
europepmc   +1 more source

On Some Non-Rigid Unit Distance Patterns. [PDF]

Discrete Comput Geom
Frankl N, Woodruff D.
europepmc   +1 more source

Transitivity, contextuality and decision making. [PDF]

Philos Trans A Math Phys Eng Sci
Sulis WH.
europepmc   +1 more source

SPHN Connector - a scalable pipeline for generating validated knowledge graphs from federated and semantically enriched health data. [PDF]

BMC Med Inform Decis Mak
Touré V, Unni D, Krauss P, Marto AB, Kalt K, Stoira N, Pickl M, Österle S.   +7 more
europepmc   +1 more source

Compression theory for inhomogeneous systems. [PDF]

Nat Commun
Gökmen DE, Biswas S, Huber SD, Ringel Z, Flicker F, Koch-Janusz M.   +5 more
europepmc   +1 more source

Finding maximum common contractions between phylogenetic networks. [PDF]

Algorithms Mol Biol
Marchand B, Tahiri N, Fard SG, Tremblay-Savard O, Lafond M.   +4 more
europepmc   +1 more source

Strategy Complexity of Reachability in Countable Stochastic 2-Player Games. [PDF]

Dyn Games Appl
Kiefer S, Mayr R, Shirmohammadi M, Totzke P.   +3 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Forbidden subgraphs and forbidden substructures

Journal of Symbolic Logic, 2001
AbstractThe problem of the existence of a universal structure omitting a finite set of forbidden substructures is reducible to the corresponding problem in the category of graphs with a vertex coloring by two colors. It is not known whether this problem reduces further to the category of ordinary graphs.
Cherlin, Gregory, Shi, Niandong
openaire   +2 more sources