Given two 3-connected graphs G and H, a construction sequence constructs
G from H (e. g. from the K4) with three basic operations, called
the Barnette-Grünbaum operations. These...
Following [KP07], we analyze surfaces arising as an infinite sequence of guided C2 surface rings. However, here we focus on constructions of too low a degree to be curvature conti...
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...