1. Home
  2. Hardness of approximation
  Subject:

Hardness of approximation   New Search

View on DBpedia    View on Wikipedia
Top related subjects:
 Random oracle NP-hardness Tutte polynomial Travelling salesman problem Topology Time complexity Theorem Symmetric group Subset sum problem Stream cipher Hardness of approximation Cloud computing Ciphertext indistinguishability Access control Smart city Algorithm Mathematical optimization Metaheuristic Graph theory Total order Sharp-P Quantum computing Polynomial Graph (discrete mathematics) Combinatorial optimization Geometry Stiffness Approximation algorithm Classical mechanics Banach space Holomorphic function Combinatorics Srinivasa Ramanujan Special linear group René Descartes Regular representation Renewable Energy Corporation Homomorphic encryption RC4 Signal processing Pseudorandomness Pseudorandom number generator
RELATED SUBJECTS:
The publications listed also have these subjects
Random oracle  2 times
NP-hardness  2 times
Travelling salesman problem  1 time
Topology  1 time
Time complexity  1 time
Theorem  1 time
Symmetric group  1 time
Srinivasa Ramanujan  1 time
Spanning tree  1 time
Quantum computing  1 time
Public-key cryptography  1 time
Psychological manipulation  1 time
Plaintext  1 time
Multi-agent system  1 time
Minimax  1 time
Locality of reference  1 time
Heuristic  1 time
E-commerce  1 time
Divisor  1 time
Data compression  1 time
Computational complexity theory  1 time
Cloud computing  1 time
Association for Computing Machinery  1 time
Algorithm  1 time

Publications tagged with this subject: 12

Note: Top 50 publications shown only. Open an item panel to view more info (open all)


1. Finding Non-orientable Surfaces in 3-Manifolds

2. Chain-constrained spanning trees

3. A tight lower bound for the hardness of clutters

4. Computational aspects of strategic behaviour in elections with top-truncated ballots

5. A multi-unit combinatorial auction based approach for decentralized multi-project scheduling

6. A pseudorandom number generator based on worst-case lattice problems

7. Local Expanders

8. Investigating TSP Heuristics for Location-Based Services

9. The Complexity of Approximating complex-valued Ising and Tutte partition functions

10. Outsourced pattern matching

11. Efficient Chosen-Ciphertext Secure Encryption from R-LWE

12. Order-Preserving Encryption Using Approximate Integer Common Divisors


Questions?

Drop us a message.