Computing on binary strings

Many problems in Computer Science can be abstracted to the following question: given a set of objects and rules respectively, which new objects can be produced? In the paper, we consider a succinct version of the question: given a set of binary strings and several operations like conjunction and dis...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theoretical computer science Ročník 562; s. 122 - 128
Hlavní autori:	Bu, Tian-Ming, Yuan, Chen, Zhang, Peng
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 2015
Predmet:	[formula omitted]-complete [formula omitted]-hard Algorithms Approximation Binary strings Boolean operation Combinatorial algorithm Computation Counting Mathematical analysis Operators Strings Binary strings Boolean operation NP-hard P-complete Combinatorial algorithm
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!