Ancestors (7)
- Boolean function
- Boolean hypercube
- Analysis of Boolean functions
- Combinatorics
- Area of mathematics
- Mathematics
- Home
Incoming links (39)
- Admissible predicate on lazy lists
- Automated deduction
- Blocks world
- Data validation
- Direct fold obstruction for dropping a prefix
- E. F. Codd
- Filtering a list by unfolding
- List filter
- Past exam of the computer science course of the University of Oxford / 2015 / Intelligent systems / 2 / a / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Intelligent systems / 2 / b / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Object oriented programming / 3 / b / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Object oriented programming / 3 / c / Solution
- Past exam of the computer science course of the University of Oxford / 2019 / Artificial intelligence / 3 / a / Solution
- Past exam of the computer science course of the University of Oxford / 2019 / Artificial intelligence / 3 / c / Solution
- Past exam of the computer science course of the University of Oxford / 2022 / Artificial intelligence / 1 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Imperative programming / 6 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Imperative programming / 6 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2014 / Imperative programming / 5 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Digital systems, linear algebra, introduction to formal proof (resit) / 8 / a / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Imperative programming (resit) / 7 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Imperative programming (resit) / 7 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2016 / Digital systems, linear algebra, introduction to formal proof / 8 / c / iii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2016 / Imperative programming / 5 / d / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2016 / Imperative programming / 5 / e / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2017 / Functional programming, design and analysis of algorithms / 1 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2017 / Functional programming, design and analysis of algorithms (resit) / 4 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Functional programming, design and analysis of algorithms (resit) / 1 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Functional programming, design and analysis of algorithms (resit) / 1 / c / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Functional programming, design and analysis of algorithms (resit) / 1 / d / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Functional programming, design and analysis of algorithms (resit) / 1 / f / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Functional programming, design and analysis of algorithms (resit) / 3 / c / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Functional programming, design and analysis of algorithms (resit) / 3 / e / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2023 / Functional programming, design and analysis of algorithms / 4 / e / Solution
- Predicate prefix-suffix reconstruction
- Predicate span
- Prefix-dropping iterator
- Stable list partition
- Tree fold
- Tuple relational calculus
Discussion (0) New discussion
There are no discussions about this article yet.
Articles by others on the same topic (0)
There are currently no matching articles.