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

Small programming exercises 20

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

DOI10.1016/0167-6423(88)90023-8zbMATH Open0632.68011OpenAlexW2018910079MaRDI QIDQ1095637

B. George

Publication date: 1988

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(88)90023-8



zbMATH Keywords

square recognitionmaximum productnumber of surpassers


Mathematics Subject Classification ID

General topics in the theory of software (68N01)



Related Items (2)

Small programming exercises 24 ⋮ Calculating a linear-time solution to the densest-segment problem






This page was built for publication: Small programming exercises 20

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1095637&oldid=13126573"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 02:25.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki