The following pages link to Petra Wolf (Q544622):
Displayed 19 items.
- The use of Roc for defining the validity of the prognostic index in censored data (Q544625) (← links)
- Deciding regular intersection emptiness of complete problems for PSPACE and the polynomial hierarchy (Q1647695) (← links)
- From decidability to undecidability by considering regular sets of instances (Q2062120) (← links)
- Learning from positive and negative examples: dichotomies and parameterized algorithms (Q2169975) (← links)
- Restricted Power - Computational Complexity Results for Strategic Defense Games (Q3305735) (← links)
- (Q5089200) (← links)
- Semicomputable points in Euclidean spaces (Q5092426) (← links)
- Properties of graphs specified by a regular language (Q5896894) (← links)
- Properties of graphs specified by a regular language (Q5918788) (← links)
- On the decidability of finding a positive ILP-instance in a regular set of ILP-instances (Q5918790) (← links)
- On the decidability of finding a positive ILP-instance in a regular set of ILP-instances (Q5970850) (← links)
- Learning from positive and negative examples: new proof for binary alphabets (Q6072211) (← links)
- Order Reconfiguration under Width Constraints (Q6075707) (← links)
- (Q6113365) (← links)
- (Q6134263) (← links)
- Order Reconfiguration Under Width Constraints. (Q6168416) (← links)
- Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs (Q6169534) (← links)
- Synchronizing deterministic push-down automata can be really hard (Q6186317) (← links)
- (Q6187048) (← links)