Pages that link to "Item:Q2387433"
From MaRDI portal
The following pages link to On the computational complexity of defining sets (Q2387433):
Displaying 9 items.
- Critical sets for Sudoku and general graph colorings (Q393178) (← links)
- On the algebraic complexity of set equality and inclusion (Q834932) (← links)
- The complexity types of computable sets (Q1190982) (← links)
- Some descriptive-set-theoretical problems in complexity theory (Q1328888) (← links)
- On the complexity of computing with zero-dimensional triangular sets (Q1930161) (← links)
- The Computational Complexity of Choice Sets (Q3392310) (← links)
- (Q4375806) (← links)
- On computational complexity of set automata (Q5920130) (← links)
- Sets computable in polynomial time on average (Q6085734) (← links)