The following pages link to (Q4071737):
Displaying 50 items.
- Physical portrayal of computational complexity (Q408483) (← links)
- Low-depth witnesses are easy to find (Q445240) (← links)
- The evolution of human communication and the information revolution --- A mathematical perspective (Q596949) (← links)
- Inverse monoids associated with the complexity class NP (Q666698) (← links)
- Finite-model theory -- A personal perspective (Q688663) (← links)
- Polynomial time computations in models of ET (Q795035) (← links)
- Sophistication revisited (Q841628) (← links)
- Time hierarchies for cryptographic function inversion with advice (Q843601) (← links)
- In some curved spaces, one can solve NP-hard problems in polynomial time (Q843612) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- A faster distributed protocol for constructing a minimum spanning tree (Q856405) (← links)
- Complexity questions in number theory (Q1059094) (← links)
- How to prove representation-independent independence results (Q1091820) (← links)
- Fast probabilistic algorithms for Hamiltonian circuits and matchings (Q1141153) (← links)
- Optimal algorithms for co-NP-sets and the EXP\(\overset{!}{ = }\)NEXP problem (Q1178072) (← links)
- Constructive complexity (Q1182305) (← links)
- On the theory of average case complexity (Q1190984) (← links)
- Self-witnessing polynomial-time complexity and prime factorization (Q1200292) (← links)
- On search, decision, and the efficiency of polynomial-time algorithms (Q1342869) (← links)
- An excursion to the Kolmogorov random strings (Q1362331) (← links)
- The discovery of algorithmic probability (Q1370859) (← links)
- A denial-of-service attack on fiber-based continuous-variable quantum key distribution (Q1632674) (← links)
- On relationships between complexity classes of Turing machines (Q1682916) (← links)
- Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol (Q1686055) (← links)
- Autonomous theory building systems (Q1897404) (← links)
- The complexity of problems for quantified constraints (Q1959381) (← links)
- What one has to know when attacking \(\mathsf{P}\) vs.\(\mathsf{NP}\) (Q2009642) (← links)
- A theory of incremental compression (Q2056272) (← links)
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search (Q2074664) (← links)
- Towards a unified approach to black-box constructions of zero-knowledge proofs (Q2139627) (← links)
- The complete set of minimal simple graphs that support unsatisfiable 2-CNFs (Q2192070) (← links)
- Satisfiability modulo theories and chiral heterotic string vacua with positive cosmological constant (Q2233841) (← links)
- Making sense of sensory input (Q2238610) (← links)
- Optimal testing for planted satisfiability problems (Q2259537) (← links)
- Computational depth: Concept and applications (Q2368976) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- The 2004 Benjamin Franklin medal in computer and cognitive science presented to Richard M. Karp (Q2571820) (← links)
- Resource bounded symmetry of information revisited (Q2575757) (← links)
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer (Q2818017) (← links)
- $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
- Fixed-Parameter Tractability, A Prehistory, (Q2908528) (← links)
- Notes on Levin’s Theory of Average-Case Complexity (Q3088187) (← links)
- On Khot’s unique games conjecture (Q3109809) (← links)
- On Dinur’s proof of the PCP theorem (Q3430210) (← links)
- Algebraic Attacks against Random Local Functions and Their Countermeasures (Q4600698) (← links)
- Diverse Palindromic Factorization is NP-Complete (Q4640035) (← links)
- Smoothing the Gap Between NP and ER (Q5071086) (← links)
- Satisfiability in Boolean Logic (SAT problem) is polynomial? (Q5071401) (← links)
- Deciding Parity Games in Quasi-polynomial Time (Q5073521) (← links)
- Randomness and Intractability in Kolmogorov Complexity (Q5091181) (← links)
