Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
HasRadicalMember Concept Reference

Concept definition

template<typename MP>
concept HasRadicalMember = requires(const MP &f, const Array<MP> &gens)
{
{ MP::radical_member(f, gens) } -> std::same_as<bool>;
}
Aleph::Array
Simple dynamic array with automatic resizing and functional operations.
Definition tpl_array.H:139
Aleph::divide_and_conquer_partition_dp
Divide_Conquer_DP_Result< Cost > divide_and_conquer_partition_dp(const size_t groups, const size_t n, Transition_Cost_Fn transition_cost, const Cost inf=dp_optimization_detail::default_inf< Cost >())
Optimize partition DP using divide-and-conquer optimization.
Definition DP_Optimizations.H:133

Detailed Description

Definition at line 43 of file multi_polynomial_test.cc.