NYU Faculty Digital Archive
metadata only
AN EXTENDED ATMS FOR DECOMPOSABLE PROBLEMS
When dealing with nearly decomposable problems such as those described by Simon (1973), the problem components may be worked on by different problem solvers that are spatially and temporally separated, with each problem solver constrained by assumptions it makes about the activities and choices o
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Decombination Problem for Cosmopsychism is not the Heterogeneity Problem for Priority Monism#753929
- Contextualist Solutions to Three Puzzles about Practical Conditionals#721039
- Criticality and universality in network dismantling#780916
- Criticality and universality in network dismantling#779541
- FPT=PTIME for Homomorphism Problems on Sparse-Incidence and Bounded-Independence Patterns#1036229
Record · ID 933456
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive