Pages that link to "Item:Q5248499"
From MaRDI portal
The following pages link to Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions (Q5248499):
Displayed 4 items.
- Approximate solution of NP optimization problems (Q672315) (← links)
- The relativized relationship between probabilistically checkable debate systems, IP and PSPACE (Q673812) (← links)
- Hierarchically specified unit disk graphs (Q1269904) (← links)
- On the longest circuit in an alterable digraph (Q1904653) (← links)