Pages that link to "Item:Q4035692"

The following pages link to (Q4035692):

Displaying 7 items.

• The complexity of the max word problem and the power of one-way interactive proof systems (Q1312183) (← links)
• The complexity of computing maximal word functions (Q1321032) (← links)
• On the complexity of partially observed Markov decision processes (Q1351500) (← links)
• The complexity of approximating a nonlinear program (Q1906280) (← links)
• Max NP-completeness made easy (Q1960655) (← links)
• The Max-Atom Problem and Its Relevance (Q5505542) (← links)
• Logspace verifiers, NC, and NP (Q6487945) (← links)