NP-hardness - PDFSEARCH.IO - Document Search Engine

NP-hardness
Results: 35

#	Item
31	Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems Akinori Kawachi∗ Keisuke Tanaka∗ Add to Reading List Source URL: xagawa.net Language: English - Date: 2010-01-23 11:51:04 Lattice problem Commitment scheme Universal hashing Lattice-based cryptography Zero-knowledge proof NP Cryptographic hash function IP Hash function Cryptography Theoretical computer science Applied mathematics
32	Approximation and Hardness Results for Label Cut and Related Problems Peng Zhang ∗ Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2008-02-10 09:20:05 NP-complete problems Combinatorial optimization Maximum flow problem Graph coloring Cut Minimum k-cut Optimization problem Max-flow min-cut theorem Set cover problem Theoretical computer science Mathematics Graph theory
33	Coping With NP-Hardness Approximation Algorithms Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2001-05-07 12:05:44 Operations research NP-complete problems Combinatorial optimization Approximation algorithms Travelling salesman problem Christofides algorithm Polynomial-time approximation scheme Optimization problem Knapsack problem Theoretical computer science Computational complexity theory Applied mathematics
34	Probabilistic Checking of Proofs and Hardness of Approximation Problems Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2005-03-10 11:31:01 Probabilistic complexity theory Mathematical optimization Probabilistically checkable proof Sanjeev Arora PCP theorem Complexity classes MAX-3SAT Hardness of approximation NP Theoretical computer science Applied mathematics Computational complexity theory
35	Interactive Proofs and the Hardness of Approximating Cliques Uriel Feige ∗ Add to Reading List Source URL: web.cs.elte.hu Language: English - Date: 2007-01-10 14:31:22 Complexity classes Probabilistic complexity theory Mathematical optimization Mathematical proofs Interactive proof system NP Probabilistically checkable proof P versus NP problem MAX-3SAT Theoretical computer science Computational complexity theory Applied mathematics