Back to Results
First PageMeta Content
NP-complete problems / Analysis of algorithms / Time complexity / Pattern matching / NP / Matching / Boolean satisfiability problem / Theoretical computer science / Computational complexity theory / Applied mathematics


Generalised matching Raphael Clifford1 , Aram W. Harrow2 , Alexandru Popa1 , and Benjamin Sach1 1 Department of Computer Science, University of Bristol,UK
Add to Reading List

Document Date: 2014-03-11 07:07:18


Open Document

File Size: 150,05 KB

Share Result on Facebook

City

New York / /

Company

3SAT / /

Country

United States / United Kingdom / /

Currency

pence / USD / /

/

Facility

University of Bristol / /

IndustryTerm

polynomial algorithm / polynomial-time approximation algorithm / polynomial-time pattern matching algorithms / approximation algorithm / polynomial-time solution / approximation algorithms / search algorithms / /

Organization

University of Bristol / Department of Computer Science / Department of Mathematics / /

Person

Amihood Amir / Amir / Ai / Igor Nor / Tom Hinton / /

Position

variable gadgets Vp / Vp / Prime Minister / Vp Cp / Vp $Cp and text $$Vt $Ct iff / $$Vp / Vp $Cp and text / pattern $$Vp / /

ProvinceOrState

Tennessee / New York / Connecticut / /

PublishedMedium

the Theory of Computing / Theory of Computing / /

Technology

polynomial-time approximation algorithm / 5 An approximation algorithm / approximation algorithm / search algorithms / polynomial-time pattern matching algorithms / approximation algorithms / The algorithm / polynomial algorithm / /

SocialTag