Complexity of restricted variants of Skolem and related problems

Bibliographic Details
Main Authors: Akshay, S, Balaji, N, Vyas, N
Format: Conference item
Published: Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017
_version_ 1797064628146012160
author Akshay, S
Balaji, N
Vyas, N
author_facet Akshay, S
Balaji, N
Vyas, N
author_sort Akshay, S
collection OXFORD
description
first_indexed 2024-03-06T21:17:06Z
format Conference item
id oxford-uuid:402485f3-15fe-4729-a11f-28ac813bccbc
institution University of Oxford
last_indexed 2024-03-06T21:17:06Z
publishDate 2017
publisher Schloss Dagstuhl - Leibniz-Zentrum für Informatik
record_format dspace
spelling oxford-uuid:402485f3-15fe-4729-a11f-28ac813bccbc2022-03-26T14:36:17ZComplexity of restricted variants of Skolem and related problemsConference itemhttp://purl.org/coar/resource_type/c_5794uuid:402485f3-15fe-4729-a11f-28ac813bccbcSymplectic Elements at OxfordSchloss Dagstuhl - Leibniz-Zentrum für Informatik2017Akshay, SBalaji, NVyas, N
spellingShingle Akshay, S
Balaji, N
Vyas, N
Complexity of restricted variants of Skolem and related problems
title Complexity of restricted variants of Skolem and related problems
title_full Complexity of restricted variants of Skolem and related problems
title_fullStr Complexity of restricted variants of Skolem and related problems
title_full_unstemmed Complexity of restricted variants of Skolem and related problems
title_short Complexity of restricted variants of Skolem and related problems
title_sort complexity of restricted variants of skolem and related problems
work_keys_str_mv AT akshays complexityofrestrictedvariantsofskolemandrelatedproblems
AT balajin complexityofrestrictedvariantsofskolemandrelatedproblems
AT vyasn complexityofrestrictedvariantsofskolemandrelatedproblems