Pages that link to "Item:Q3912012"
From MaRDI portal
The following pages link to A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems (Q3912012):
Displaying 48 items.
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- A low-memory algorithm for finding short product representations in finite groups. (Q664395) (← links)
- On the minimum gap between sums of square roots of small integers (Q719286) (← links)
- Improved simulation of nondeterministic Turing machines (Q764330) (← links)
- An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem (Q852950) (← links)
- Asymptotic results for the number of Wagner's solutions to a generalised birthday problem (Q900974) (← links)
- The complexity of searching in \(X+Y\) and other multisets (Q911276) (← links)
- Sort and Search: exact algorithms for generalized domination (Q989487) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- Average polynomial time complexity of some NP-complete problems (Q1091815) (← links)
- Polynomial-average-time satisfiability problems (Q1095678) (← links)
- An \(O(n^{lg\,k}\cdot 2^{n/2})\) time and \(O(k\cdot 2^{n/k})\) space algorithm for certain NP-complete problems (Q1101220) (← links)
- A complete anytime algorithm for number partitioning (Q1277696) (← links)
- On space-efficient algorithms for certain NP-complete problems (Q1314378) (← links)
- Correspondence principle as equivalence of categories (Q1702195) (← links)
- Improved combinatorial algorithms for the inhomogeneous short integer solution problem (Q1715853) (← links)
- New algorithms for exact satisfiability (Q1770407) (← links)
- Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme (Q1784985) (← links)
- Faster exact solutions for some NP-hard problems. (Q1853491) (← links)
- An efficient pruning algorithm for value independent knapsack problem using a DAG structure (Q1891244) (← links)
- Lattice-based algorithms for number partitioning in the hard phase (Q1926495) (← links)
- An algorithmic framework for the generalized birthday problem (Q1999907) (← links)
- Efficient dissection of bicomposite problems with cryptanalytic applications (Q2010595) (← links)
- A mixed-integer linear programming model to solve the multidimensional multi-way number partitioning problem (Q2026995) (← links)
- Cryptanalysis of the GPRS encryption algorithms GEA-1 and GEA-2 (Q2056728) (← links)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms (Q2119016) (← links)
- He gives C-sieves on the CSIDH (Q2119021) (← links)
- Quantum security analysis of CSIDH (Q2119022) (← links)
- Refined cryptanalysis of the GPRS ciphers GEA-1 and GEA-2 (Q2170080) (← links)
- An algebraic expression of the number partitioning problem (Q2197434) (← links)
- Improved algorithms for the general exact satisfiability problem (Q2232607) (← links)
- Partition into triangles on bounded degree graphs (Q2392247) (← links)
- On the connection between Hamming codes, Heapsort and other methods (Q2444852) (← links)
- Open problems around exact algorithms (Q2473037) (← links)
- A new algorithm for optimal 2-constraint satisfaction and its implications (Q2581276) (← links)
- Improved classical and quantum algorithms for subset-sum (Q2692398) (← links)
- New Definition of Density on Knapsack Cryptosystems (Q3506377) (← links)
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems (Q4687248) (← links)
- (Q5009597) (← links)
- The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound (Q5041235) (← links)
- (Q5075820) (← links)
- Time-Memory Tradeoffs for Large-Weight Syndrome Decoding in Ternary Codes (Q5087252) (← links)
- An Improved Multi-set Algorithm for the Dense Subset Sum Problem (Q5387614) (← links)
- Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems (Q5855059) (← links)
- Subset Sum Quantumly in 1.17 n . (Q5889072) (← links)
- Memory-efficient quantum information set decoding algorithm (Q6535497) (← links)
- Improved quantum algorithms for the k-XOR problem (Q6618596) (← links)
