Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Complexity of Synthesizing Inductive Assertions

From MaRDI portal
Publication:4130972
Jump to:navigation, search

DOI10.1145/322017.322029zbMATH Open0358.68031OpenAlexW2018537910MaRDI QIDQ4130972FDOQ4130972


Authors: Ben Wegbreit Edit this on Wikidata


Publication date: 1977

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322017.322029





Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25)







This page was built for publication: Complexity of Synthesizing Inductive Assertions

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4130972&oldid=17921606"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 09:01. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki