The following pages link to (Q4162663):
Displaying 19 items.
- Verifying time complexity of Turing machines (Q496007) (← links)
- Inverse monoids associated with the complexity class NP (Q666698) (← links)
- Lower bounds and the hardness of counting properties (Q703531) (← links)
- New formally undecidable propositions: Non-trivial lower bounds on proof complexity and related theorems (Q804570) (← links)
- On the complexity of ranking (Q920620) (← links)
- On some natural complete operators (Q1064780) (← links)
- On one-one polynomial time equivalence relations (Q1068536) (← links)
- Independence results about context-free languages and lower bounds (Q1071500) (← links)
- A comparison of polynomial time completeness notions (Q1097692) (← links)
- On hardness of one-way functions (Q1097693) (← links)
- A note on complexity measures for inductive classes in constructive type theory (Q1271558) (← links)
- Computational complexity and feasibility of data processing and interval computations (Q1377914) (← links)
- The complexity of online bribery in sequential elections (Q2121471) (← links)
- Collapsing degrees via strong computation (Q2366690) (← links)
- Possibilities of various types of alternating automata (Q3787476) (← links)
- Completeness for nondeterministic complexity classes (Q3979608) (← links)
- Measure independent Gödel speed‐ups and the relative difficulty of recognizing sets (Q4304121) (← links)
- Time-Complexity Semantics for Feasible Affine Recursions (Q5425322) (← links)
- Automata, Languages and Programming (Q5466484) (← links)
