Abstract
Recently, Harry Buhrman et al introduced a novel communication complexity model, called "garden-hose". This model sprout from a research on using quantum properties to allow for position based cryptography. SAT is one of the fundamental NP-Complete problem - finding a satisfying assignment to a CNF (conjunctive Normal Form) formula, or proving that none exists. We will not get into the details of the quantum physics, neither we are going to explain the internal work of SAT solver. Instead we will start from the mathematical garden hose model; describe the way we used SAT solver as a tool; give some lower and upper bounds on implementing the equality function; and conclude with open questions.
| Original language | English |
|---|---|
| DOIs | |
| State | Published - 1 Jan 2014 |
| Externally published | Yes |
| Event | 2014 IEEE Information Theory and Applications Workshop, ITA 2014 - San Diego, CA, United States Duration: 9 Feb 2014 → 14 Feb 2014 |
Conference
| Conference | 2014 IEEE Information Theory and Applications Workshop, ITA 2014 |
|---|---|
| Country/Territory | United States |
| City | San Diego, CA |
| Period | 9/02/14 → 14/02/14 |
ASJC Scopus subject areas
- Computer Science Applications
- Information Systems
Fingerprint
Dive into the research topics of 'On the riddle of coding equality function in the garden hose model'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver