Pages that link to "Item:Q1745728"
From MaRDI portal
The following pages link to Towards a unified complexity theory of total functions (Q1745728):
Displaying 22 items.
- Propositional proofs and reductions between NP search problems (Q435190) (← links)
- On total functions, existence theorems and computational complexity (Q808245) (← links)
- On the complexity of finding falsifying assignments for Herbrand disjunctions (Q892133) (← links)
- On functional complexity and superpositions of functions (Q1071881) (← links)
- The complexity of the parity argument with potential (Q2037189) (← links)
- Characterising the intersection of QMA and coQMA (Q2099640) (← links)
- On average-case hardness in \textsf{TFNP} from one-way functions (Q2119098) (← links)
- The Hairy Ball problem is PPAD-complete (Q2229948) (← links)
- Does the polynomial hierarchy collapse if onto functions are invertible? (Q2268347) (← links)
- Total functions in QMA (Q2684235) (← links)
- Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation (Q2968148) (← links)
- The complexity space of partial functions: a connection between complexity analysis and denotational semantics (Q3008383) (← links)
- Towards a Unified Complexity Theory of Total Functions (Q4993302) (← links)
- Approximate counting and NP search problems (Q5055313) (← links)
- The Hairy Ball Problem is PPAD-Complete. (Q5091222) (← links)
- The NP Search Problems of Frege and Extended Frege Proofs (Q5278209) (← links)
- TFNP: An Update (Q5283350) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465863) (← links)
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich (Q5863324) (← links)
- The classes PPA-\(k\): existence from arguments modulo \(k\) (Q5896088) (← links)
- The classes PPA-\(k\): existence from arguments modulo \(k\) (Q5918090) (← links)
- Note on constrained long choice with multiple beginning elements (Q6661767) (← links)