A tag is a keyword or label that categorizes your question with other, similar questions. Using the right tags makes it easier for others to find and answer your question.
An expander is a sparse (low degree) graph with high "expansion," measured in one of several ways; typically akin to the minimum ratio of the size of a subgraph boundary to the subgraph's volume.
questions about attaining and maintaining a career in fields related to theoretical computer science
Given a specification, does a program satisfy it?
Questions about advice and nonuniformity
Given a program and the input for it, does it halt or run forever?
A path in a graph is said to be Hamiltonian if it visits each vertex exactly once.
Topology the study of objects that can be continuously deformed into other objects without tearing or making holes in the object. It can also mean a family of sets that have the property of a topologi…
For a graph, a maximum cut is a cut whose size is at least the size of any other cut. The problem of finding a maximum cut in a graph is known as the max-cut problem.
In logic, temporal logic is any system of rules and symbolism for representing, and reasoning about, propositions qualified in terms of time
Calculus of Constructions (CoC) is a dependent type system. It's on the lambda cube and is implemented in the Coq proof assistant.
Questions about Software/Programs/Applications used by TCS researchers