-
541
-
542
-
543
-
544
A Survey of Maximal k-Degenerate Graphs and k-Trees
Published 2024-01-01“…These graphs are important in many problems in graph theory and computer science. Types of results surveyed include structural characterizations, enumeration, degree sets and sequences, chromatic polynomials, algorithms, and related extremal problems.…”
Get full text
Article -
545
Mechatronics Engineering /
Published 2012“…French standard NF E 01-010 gives the following definition: “approach aiming at the synergistic integration of mechanics, electronics, control theory, and computer science within product design and manufacturing, in order to improve and/or optimize its functionality".…”
Get full text
text -
546
-
547
-
548
Adversarial Laws of Large Numbers and Optimal Regret in Online Classification
Published 2022Get full text
Article -
549
Almost Optimal Super-Constant-Pass Streaming Lower Bounds for Reachability
Published 2022Get full text
Article -
550
-
551
-
552
Online Edge Coloring via Tree Recurrences and Correlation Decay
Published 2022Get full text
Article -
553
-
554
-
555
-
556
-
557
-
558
-
559
Decorated TQFTs and their Hilbert spaces
Published 2023-08-01“…Abstract We discuss topological quantum field theories that compute topological invariants which depend on additional structures (or decorations) on three-manifolds. …”
Get full text
Article -
560
Reparametrization ghost contribution to superstring multiloop amplitudes.
Published 1992“…We use the sewing procedure in the operator formalism to construct the N-point g-loop vertex VN;g for the (b,c) system in superstring theory. After computing explicitly the lowest picture-changed states, we saturate VN;g with them showing that the reparametrization ghost contribution to g-loop superstring amplitudes is just the same as in bosonic string theory. © 1992 The American Physical Society.…”
Journal article