On the complexity of computation of rudimentary predicates

DOI10.1515/DMA.2000.10.6.571zbMATH Open1044.03026OpenAlexW2009068921MaRDI QIDQ4809504FDOQ4809504

Authors S. S. Marchenkov 

Publication date 30 August 2004

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.2000.10.6.571

zbMATH Keywords

computational complexityalternating Turing machinesnumerical predicates

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• scientific article; zbMATH DE number 1088223
• On the polynomial computability of some rudimentary predicates.
• Computational complexity of theories of a binary predicate with a small number of variables
• New Computational Paradigms
• scientific article; zbMATH DE number 3336809
• scientific article; zbMATH DE number 4116512
• A characterization of the complexity of recursive predicates
• scientific article; zbMATH DE number 1390276
• scientific article; zbMATH DE number 3950521
• Complexity bounds on general hard-core predicates.

Cited In (8)

• The role of rudimentary relations in complexity theory
• On the polynomial computability of some rudimentary predicates.
• Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents
• Logical Approaches to Computational Barriers
• Title not available (Why is no real title available?)
• On the computational complexity of finding hard tautologies
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)

This page was built for publication: On the complexity of computation of rudimentary predicates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4809504)