instruction stringlengths 0 29.8k ⌀ |
|---|
First, a point of terminology: what you describe is [symmetric encryption](http://en.wikipedia.org/wiki/Symmetric_encryption), and a key that's shared between participants is usually known as a secret key; “private key” usually means the part of a key in [public-key cryptography](http://en.wikipedia.org/wiki/Public-key... |
*Note: This is a seeding question, so please feel free to be pedantic etc. I will be deleting this paragraph some time after accepting an answer.*
I recently read that it is possible to have arrays which need not be initialized, i.e. it is possible to use them without having to spend any time trying to set each memb... |
3SAT is a famous special case of the boolean satisfiability problem (SAT). |
null |
###Closure Properties###
Once you have a small collection of non-context-free languages you can often use [closure properties](https://en.wikipedia.org/wiki/Context-free_language#Closure_properties) of $\mathrm{CFL}$ like this:
> Assume $L \in \mathrm{CFL}$. Then, by closure property X (together with Y), $L' \in \... |
The Eagles are a rock supergroup from the 70s and 80s, responsible for such classics as _Hotel California_. They have two quite distinctive sounds, one where guitarist Joe Walsh is present (for example, in _Life in the Fast Lane_) and one where he is absent. The latter songs have a markedly more sombre/boring feel.
... |
Unsupervised learning of Sound Files (The Joe Walsh Problem) |
|machine-learning| |
###Closure Properties###
Once you have a small collection of non-context-free languages you can often use [closure properties](https://en.wikipedia.org/wiki/Context-free_language#Closure_properties) of $\mathrm{CFL}$ like this:
> Assume $L \in \mathrm{CFL}$. Then, by closure property X (together with Y), $L' \in \... |
A typical [generational garbage collector](http://en.wikipedia.org/wiki/Garbage_collection_%28computer_science%29#Generational_GC_.28ephemeral_GC.29) keeps recently allocated data in a separate memory region. In typical programs, a lot of data is short-lived, so collecting young garbage (a minor GC cycle) frequently an... |
Are generational garbage collectors inherently cache-friendly? |
|cpu-cache| |
[NP-hard](http://en.wikipedia.org/wiki/NP-hard) problems are [NP-complete](http://en.wikipedia.org/wiki/NP_%28complexity%29) and harder problems. More precisely, a [decision problem](http://en.wikipedia.org/wiki/Decision_problem) $H$ is NP-hard if there is another problem $H'$ that is NP-complete that can be reduced in... |
null |
decision problems that are at least as hard as NP-complete problems |
null |
Counting, construction and analysis of finite or countable discrete structures. |
null |
Methods to store data so that it can be used advantageously by algorithms. |
null |
Ways of storing data so that it can be used advantageously by algorithms. |
null |
[Encryption](http://en.wikipedia.org/wiki/Encryption) is a mathematical transformation of data (the plaintext) into a ciphertext which is unreadable to principals who do not possess the proper [key](http://en.wikipedia.org/wiki/Key_%28cryptography%29). Use this tag in addition to [tag:cryptography] if your question is ... |
null |
a transformation of information to make it unreadable to outside observers |
null |
An elementary automaton model with finite memory. It is equivalent to regular languages and the basis for many more complex models. |
null |
Principles of software that interfaces between hardware and applications. |
null |
Algorithms that decide wether a given string belongs to a fixed formal language. |
null |
Algorithms that decide whether a given string belongs to a fixed formal language. |
null |
Concurrent systems are systems where several threads of computation are potentially executing simultaneously and interacting. |
null |
[Concurrency](http://en.wikipedia.org/wiki/Concurrency_%28computer_science%29) is the study of systems in which multiple threads of computation or processes execute in the same environment and at the same time. The concurrent threads may execute simultaneously on different processors or in turns. Concurrency studies ho... |
null |
A [process calculus](http://en.wikipedia.org/wiki/Process_calculus), or process algebra, is a formal model of concurrent systems (see also [tag:concurrency]).
### Examples of process calculi
* [tag:acp] [ACP](http://en.wikipedia.org/wiki/Algebra_of_Communicating_Processes)
* [tag:ccs] [CCS](http://en.wikipedia... |
null |
Process algebras (also known as process calculi) are formal models of concurrency |
null |
Using as few resources (e.g. time, space) as possible while solving a problem. |
null |
A recursive object (e.g. function or data structure) is defined using itself. |
null |
[Concurrency](http://en.wikipedia.org/wiki/Concurrency_%28computer_science%29) is the study of systems in which multiple threads of computation or processes execute in the same environment and at the same time. The concurrent threads may execute simultaneously on different processors or in turns. Concurrency studies ho... |
null |
A discrete structure of nodes which are connected by edges. Popular flavors are trees and networks with edge capacity. |
null |
A data structure that addresses stored values using a function that maps many values to few addresses. |
null |
The Eagles are a rock supergroup from the 70s and 80s, responsible for such classics as _Hotel California_. They have two quite distinctive sounds, one where guitarist Joe Walsh is present (for example, in _Life in the Fast Lane_) and one where he is absent. The latter songs have a markedly more sombre/boring feel.
... |
Classification of Songs (The Joe Walsh Problem) |
A [hash table](http://en.wikipedia.org/wiki/Hash_table) is a finite map (i.e. a dictionary), mapping keys to associated values, which relies on a hash function to map keys to a small integer that is typically used as an index in an array.
Hash tables are more efficient than other finite map data structures for many ... |
null |
A finite map data structure that addresses stored values using a function that maps many values to few addresses. |
null |
[Natural language processing](http://en.wikipedia.org/wiki/Natural_language_processing) studies the algorithmic analysis and production of texts in human languages. It is closely related to [computational linguistics](http://en.wikipedia.org/wiki/Computational_linguistics). Modern NLP techniques make heavy use of [tag:... |
null |
Natural language processing |
null |
[Coq](http://coq.inria.fr/what-is-coq) is an interactive theorem prover based on the [calculus of inductive constructions](http://en.wikipedia.org/wiki/Calculus_of_inductive_constructions).
### Resources
* [Coq website](http://coq.inria.fr/)
* [Official documentation list](http://coq.inria.fr/documentation)
* [... |
null |
Coq is an interactive theorem prover based on the Calculus of Inductive Constructions. |
null |
There are a great many data structures that implement the priority-queue interface:
* Insert: insert an element into the structure
* Get-Min: return the smallest element in the structure
* Extract-Min: remove the smallest element in the structure
These structures are also commonly known as (min)[heaps][1].
U... |
Does there exist a priority queue with $O(1)$ extracts? |
|data-structures|heaps|amortized-analysis| |
There are a great many data structures that implement the priority-queue interface:
* Insert: insert an element into the structure
* Get-Min: return the smallest element in the structure
* Extract-Min: remove the smallest element in the structure
Common data structures implementing this interface are (min)[heap... |
There are a great many data structures that implement the priority-queue interface:
* Insert: insert an element into the structure
* Get-Min: return the smallest element in the structure
* Extract-Min: remove the smallest element in the structure
Common data structures implementing this interface are (min)[heap... |
|data-structures|amortized-analysis|priority-queues| |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.