Revise Search
Articles/Chapters/Volumes | |||
| Publication | Issue | Title | |
| Quaderni di Matematica | Toward a unifed approach for the classification of np-complete optimization problems | Conclusion | |
| G. Ausellio , A. Spaccamela Marchetti , M. Protasi | |||
| Quaderni di Matematica | Toward a unifed approach for the classification of np-complete optimization problems | Strong np-completeness and its relation to rigidity | |
| G. Ausellio , A. Spaccamela Marchetti , M. Protasi | |||
| Quaderni di Matematica | Toward a unifed approach for the classification of np-complete optimization problems | Truncated combinatorial problems and their properties | |
| G. Ausellio , A. Spaccamela Marchetti , M. Protasi | |||
| Quaderni di Matematica | Toward a unifed approach for the classification of np-complete optimization problems | Basic concepts and terminology | |
| G. Ausellio , A. Spaccamela Marchetti , M. Protasi | |||
| 1 - 4 of 4 Items | |||
Search tips:
- Search terms are case-insensitive
- Common words are ignored
- By default only articles containing all terms in the query are returned (i.e., AND is implied)
- Combine multiple words with OR to find articles containing either term; e.g., education OR research
- Use parentheses to create more complex queries; e.g., archive ((publication OR conference) NOT theses)
- Search for an exact phrase by putting it in quotes; e.g., "open access publishing"
- Exclude a word by prefixing it with - or NOT; e.g. online -politics or online NOT politics
- Use * in a term as a wildcard to match any sequence of characters; e.g., soci* morality would match documents containing "sociological" or "societal"