article

Relational queries computable in polynomial time

Author:

Neil ImmermanAuthors Info & Claims

Information and Control, Volume 68, Issue 1-3

Pages 86 - 104

https://doi.org/10.1016/S0019-9958(86)80029-8

Published: 01 March 1986 Publication History

Abstract

No abstract available.

Cited By

View all

Dawar APago B(2024)A Logic for P: Are we Nearly There Yet?ACM SIGLOG News10.1145/3665453.366545911:2(35-60)Online publication date: 16-May-2024
https://dl.acm.org/doi/10.1145/3665453.3665459
Corrêa AHecher MHelmert MLongo DPommerening FWoltran SKoenig SStern RVallati M(2023)Grounding planning tasks using tree decompositions and iterated solvingProceedings of the Thirty-Third International Conference on Automated Planning and Scheduling10.1609/icaps.v33i1.27184(100-108)Online publication date: 8-Jul-2023
https://dl.acm.org/doi/10.1609/icaps.v33i1.27184
Grochow JLevet M(2023)On the Parallel Complexity of Group Isomorphism via Weisfeiler–LemanFundamentals of Computation Theory10.1007/978-3-031-43587-4_17(234-247)Online publication date: 18-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-43587-4_17
Show More Cited By

Index Terms

Relational queries computable in polynomial time

Recommendations

A note on universal distributions for polynomial-time computable distributions
CCC '97: Proceedings of the 12th Annual IEEE Conference on Computational Complexity

Polynomial-time computable as well as polynomial-time samplable distributions play a central role in the theory of average-case complexity. It is known that for every constant k there are polynomial-time samplable distributions which dominate every ...
Functions Computable with Nonadaptive Queries to NP

We study FP_|| ^NP , the class of functions that can be computed in polynomial time with nonadaptive queries to an NP oracle. This is motivated by the question of whether it is possible to compute witnesses for NP sets within FP_|| ^NP . The known ...
Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization

Consider a polynomial f with an arbitrary but fixed number of variables and with integral coefficients. We present an algorithm which reduces the problem of finding the irreducible factors of f in polynomial-time in the total degree of f and the ...

Comments

Information & Contributors

Information

Published In

Information and Control Volume 68, Issue 1-3

Jan/Feb/March 1986

270 pages

ISSN:0019-9958

Editor:
Albert R Meyer

Issue’s Table of Contents

Publisher

Academic Press Professional, Inc.

United States

Publication History

Published: 01 March 1986

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

146
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dawar APago B(2024)A Logic for P: Are we Nearly There Yet?ACM SIGLOG News10.1145/3665453.366545911:2(35-60)Online publication date: 16-May-2024
https://dl.acm.org/doi/10.1145/3665453.3665459
Corrêa AHecher MHelmert MLongo DPommerening FWoltran SKoenig SStern RVallati M(2023)Grounding planning tasks using tree decompositions and iterated solvingProceedings of the Thirty-Third International Conference on Automated Planning and Scheduling10.1609/icaps.v33i1.27184(100-108)Online publication date: 8-Jul-2023
https://dl.acm.org/doi/10.1609/icaps.v33i1.27184
Grochow JLevet M(2023)On the Parallel Complexity of Group Isomorphism via Weisfeiler–LemanFundamentals of Computation Theory10.1007/978-3-031-43587-4_17(234-247)Online publication date: 18-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-43587-4_17
Vianu VLibkin LPichler RGuagliardo P(2021)Datalog UnchainedProceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3452021.3458815(57-69)Online publication date: 20-Jun-2021
https://dl.acm.org/doi/10.1145/3452021.3458815
Tucker-Foltz JGorla D(2021)Inapproximability of unique games in fixed-point logic with countingProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470706(1-13)Online publication date: 29-Jun-2021
https://dl.acm.org/doi/10.1109/LICS52264.2021.9470706
Hannula M(2018)Hierarchies in Inclusion Logic with Lax SemanticsACM Transactions on Computational Logic10.1145/320452119:3(1-23)Online publication date: 13-Sep-2018
https://dl.acm.org/doi/10.1145/3204521
Pakusa WSchalthöfer SSelman E(2018)Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial TimeACM Transactions on Computational Logic10.1145/315445619:2(1-27)Online publication date: 9-Feb-2018
https://dl.acm.org/doi/10.1145/3154456
Arenas MMuñoz MRiveros CAceto LIngólfsdóttir A(2017)Descriptive complexity for counting complexity classesProceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3329995.3330085(1-12)Online publication date: 20-Jun-2017
https://dl.acm.org/doi/10.5555/3329995.3330085
Abramsky SDawar AWang PAceto LIngólfsdóttir A(2017)The pebbling comonad in finite model theoryProceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3329995.3330064(1-12)Online publication date: 20-Jun-2017
https://dl.acm.org/doi/10.5555/3329995.3330064
Grußien BAceto LIngólfsdóttir A(2017)Capturing polynomial time using modular decompositionProceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3329995.3330058(1-12)Online publication date: 20-Jun-2017
https://dl.acm.org/doi/10.5555/3329995.3330058
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

A note on universal distributions for polynomial-time computable distributions

Functions Computable with Nonadaptive Queries to NP

Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations