1991 · 193 citations · 23 references
ComputingComputer ScienceAlgorithmsFormal MethodsTheory Of ComputationAlgorithm AnalysisComputational ComplexityStructural ComplexityTime ComplexityComplexityComplexity AnalysisComplexity-theoretic Church-turing ThesisGeneric Algorithms
Article Generic Computation and its complexity Share on Authors: Serge Abiteboul I.N.R.I.A., Le Chesnay, France I.N.R.I.A., Le Chesnay, FranceView Profile , Victor Vianu Univ. of California at San Diego, La Jolla, CA Univ. of California at San Diego, La Jolla, CAView Profile Authors Info & Claims STOC '91: Proceedings of the twenty-third annual ACM symposium on Theory of ComputingJanuary 1991 Pages 209–219https://doi.org/10.1145/103418.103444Online:03 January 1991Publication History 103citation460DownloadsMetricsTotal Citations103Total Downloads460Last 12 Months10Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
23
Principles of database and knowledge-base systems
Choice Reviews Online · 1989 · 2.7K citations
The complexity of relational query languages (Extended Abstract)
Moshe Y. Vardi · 1982 · 1.2K citations
Computing, Computer Science, Algebra +16
Relational queries computable in polynomial time
Neil Immerman · Information and Control · 1986 · 648 citations
Languages that Capture Complexity Classes
Neil Immerman · SIAM Journal on Computing · 1987 · 545 citations