The following pages link to (Q4293543):
Displaying 31 items.
- It is hard to know when greedy is good for finding independent sets (Q286978) (← links)
- On the efficiency of polynomial time approximation schemes (Q290268) (← links)
- Approximate solution of NP optimization problems (Q672315) (← links)
- If NP has polynomial-size circuits, then MA=AM (Q674343) (← links)
- Helping by unambiguous computation and probabilistic computation (Q675865) (← links)
- The navigational power of web browsers (Q692917) (← links)
- Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions (Q935140) (← links)
- On the autoreducibility of functions (Q970103) (← links)
- A note on minimum-area upward drawing of complete and Fibonacci trees (Q970209) (← links)
- Factorizing RSA keys, an improved analogue solution (Q1031929) (← links)
- Universally serializable computation (Q1384538) (← links)
- A complexity analysis of bisimilarity for value-passing processes (Q1575255) (← links)
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. (Q1608333) (← links)
- The approximability of non-Boolean satisfiability problems and restricted integer programming (Q1770383) (← links)
- Definability, decidability, complexity (Q1817073) (← links)
- Some aspects of studying an optimization or decision problem in different computational models (Q1848391) (← links)
- On the Hamming distance of constraint satisfaction problems. (Q1853512) (← links)
- Tally NP sets and easy census functions. (Q1854340) (← links)
- On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata (Q1854456) (← links)
- Max NP-completeness made easy (Q1960655) (← links)
- Data independence of read, write, and control structures in PRAM computations (Q1975968) (← links)
- A universal approach to guarantee data privacy (Q2392012) (← links)
- If P \(\neq\) NP then some strongly noninvertible functions are invertible (Q2508963) (← links)
- Sets without subsets of higher many-one degree (Q2565991) (← links)
- The Helping Hierarchy (Q4331052) (← links)
- Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP (Q4571954) (← links)
- New collapse consequences of NP having small circuits (Q4645178) (← links)
- Query order in the polynomial hierarchy (Q5055937) (← links)
- Continuous One-counter Automata (Q5875944) (← links)
- Complement for two-way alternating automata (Q5919102) (← links)
- Structure in approximation classes (Q6085751) (← links)
