Pages that link to "Item:Q4779250"
From MaRDI portal
The following pages link to A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms (Q4779250):
Displayed 33 items.
- Physical portrayal of computational complexity (Q408483) (← links)
- On an optimal randomized acceptor for graph nonisomorphism (Q413276) (← links)
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- Kolmogorov characterizations of complexity classes (Q804291) (← links)
- Relativized alternation and space-bounded computation (Q1111024) (← links)
- Time-space tradeoffs for satisfiability (Q1567402) (← links)
- On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \) (Q2120065) (← links)
- Discrete logarithm and minimum circuit size (Q2404611) (← links)
- Zero knowledge and circuit minimization (Q2407082) (← links)
- The minimum oracle circuit size problem (Q2410683) (← links)
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem (Q2660410) (← links)
- Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science (Q2672320) (← links)
- $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
- Minimum Circuit Size, Graph Isomorphism, and Related Problems (Q3176189) (← links)
- Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity (Q3297821) (← links)
- Physical consequences of P≠NP and the density matrix renormalization group annealing conjecture (Q3301992) (← links)
- Inductive Complexity of P versus NP Problem (Q4648186) (← links)
- Minimum Circuit Size, Graph Isomorphism, and Related Problems (Q4993283) (← links)
- Boris Abramovich Trakhtenbrot (Q5074416) (← links)
- (Q5091189) (← links)
- (Q5092470) (← links)
- (Q5092472) (← links)
- (Q5092482) (← links)
- (Q5121893) (← links)
- (Q5121895) (← links)
- From Logic to Theoretical Computer Science – An Update (Q5452171) (← links)
- The non-hardness of approximating circuit size (Q5918358) (← links)
- Revisiting maximum satisfiability and related problems in data streams (Q6113841) (← links)
- The power of natural properties as oracles (Q6116834) (← links)
- Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) (Q6140986) (← links)
- One-way functions and the hardness of (probabilistic) time-bounded Kolmogorov complexity w.r.t. samplable distributions (Q6145928) (← links)
- A historical note on the complexity of scheduling problems (Q6161270) (← links)
- Revisiting maximum satisfiability and related problems in data streams (Q6199395) (← links)