Skip to main content

Tags

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.

50 questions
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.
50 questions
A partial order is a binary relation over a set which is reflexive, antisymmetric, and transitive.
49 questions
Given a specification, does a program satisfy it?
49 questions
49 questions
49 questions
Questions about advice and nonuniformity
48 questions
A proof assistant is an application program that helps humans construct machine-checked proofs. General questions about proof assistants can also be asked on the Proof Assistants Stack Exchange site.
48 questions
questions about attaining and maintaining a career in fields related to theoretical computer science
47 questions
Automated theorem proving is the proving of mathematical theorems by a computer program.
47 questions
A path in a graph is said to be Hamiltonian if it visits each vertex exactly once.
46 questions
45 questions
Calculus of Constructions (CoC) is a dependent type system. It's on the lambda cube and is implemented in the Coq proof assistant.
45 questions
44 questions
Given a program and the input for it, does it halt or run forever?
43 questions
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.
43 questions
In logic, temporal logic is any system of rules and symbolism for representing, and reasoning about, propositions qualified in terms of time
42 questions
1
3 4
5
6 7
16