LICENSE
setup.py
p_vs_np/__init__.py
p_vs_np.egg-info/PKG-INFO
p_vs_np.egg-info/SOURCES.txt
p_vs_np.egg-info/dependency_links.txt
p_vs_np.egg-info/entry_points.txt
p_vs_np.egg-info/requires.txt
p_vs_np.egg-info/top_level.txt
p_vs_np/database_problems/3_satisfiability_(3sat).py
p_vs_np/database_problems/Annihilation.py
p_vs_np/database_problems/Betweenness.py
p_vs_np/database_problems/Clustering.py
p_vs_np/database_problems/K_Relevancy.py
p_vs_np/database_problems/Knapsack.py
p_vs_np/database_problems/Non_Tautology.py
p_vs_np/database_problems/Satisfiability.py
p_vs_np/database_problems/Square_Tiling.py
p_vs_np/database_problems/__init__.py
p_vs_np/database_problems/additional_key.py
p_vs_np/database_problems/algebraic_equations_over_gf2.py
p_vs_np/database_problems/alternating__maximum_weighted_matching.py
p_vs_np/database_problems/alternating_hitting_set.py
p_vs_np/database_problems/boyce_codd_normal_form_violation.py
p_vs_np/database_problems/chordal_graph_completion.py
p_vs_np/database_problems/chromatic_index.py
p_vs_np/database_problems/code_generation_for_parallel_assignments.py
p_vs_np/database_problems/code_generation_on_a_one_register_machine.py
p_vs_np/database_problems/code_generation_with_address_expressions.py
p_vs_np/database_problems/code_generation_with_unfixed_variable_locations.py
p_vs_np/database_problems/code_generation_with_unlimited_registers.py
p_vs_np/database_problems/comparative_divisibility.py
p_vs_np/database_problems/comparative_vector_inequalities.py
p_vs_np/database_problems/composite_number.py
p_vs_np/database_problems/conjunctive_boolean_query.py
p_vs_np/database_problems/conjunctive_query_foldability.py
p_vs_np/database_problems/conjunctive_satisfiability_with_functions_and_inequalities.py
p_vs_np/database_problems/consistency_of_database_frequency_tables.py
p_vs_np/database_problems/context_free_programmed_language_membership.py
p_vs_np/database_problems/context_sensitive_language_membership.py
p_vs_np/database_problems/continuous_multiple_choice_knapsack.py
p_vs_np/database_problems/cosine_product_integration.py
p_vs_np/database_problems/cost_parametric_linear_programming.py
p_vs_np/database_problems/covering_for_linear_grammars.py
p_vs_np/database_problems/crossword_puzzle_construction.py
p_vs_np/database_problems/cyclic_ordering.py
p_vs_np/database_problems/deadlock_avoidance.py
p_vs_np/database_problems/decision_tree.py
p_vs_np/database_problems/decoding_of_linear_codes.py
p_vs_np/database_problems/ensemble_computation.py
p_vs_np/database_problems/equilibrium_point.py
p_vs_np/database_problems/etol_grammar_non_emptiness.py
p_vs_np/database_problems/etol_language_membership.py
p_vs_np/database_problems/exponential_expression_divisibility.py
p_vs_np/database_problems/fault_detection_in_directed_graphs.py
p_vs_np/database_problems/fault_detection_in_logic_circuits.py
p_vs_np/database_problems/fault_detection_with_test_points.py
p_vs_np/database_problems/feasibility_register_assignment.py
p_vs_np/database_problems/feasible_basis_extension.py
p_vs_np/database_problems/finite_function_generation.py
p_vs_np/database_problems/finite_state_automata_intersection.py
p_vs_np/database_problems/finite_state_automation_inequivalence.py
p_vs_np/database_problems/first_order_subsumption.py
p_vs_np/database_problems/first_order_theory_of_equality.py
p_vs_np/database_problems/flow_shop_scheduling.py
p_vs_np/database_problems/generalized__instant_insanity.py
p_vs_np/database_problems/generalized_geography.py
p_vs_np/database_problems/generalized_hex_(*).py
p_vs_np/database_problems/generalized_kayles.py
p_vs_np/database_problems/generalized_satisfiability.py
p_vs_np/database_problems/graph_genus.py
p_vs_np/database_problems/graph_isomorphism.py
p_vs_np/database_problems/inequivalence_of_finite_memory_programs.py
p_vs_np/database_problems/inequivalence_of_programs_with_arrays.py
p_vs_np/database_problems/inequivalence_of_programs_with_assignments.py
p_vs_np/database_problems/inequivalence_of_simple_functions.py
p_vs_np/database_problems/integer_expression_membership.py
p_vs_np/database_problems/integer_knapsack.py
p_vs_np/database_problems/integer_programming.py
p_vs_np/database_problems/job_shop_scheduling.py
p_vs_np/database_problems/left_right_hackenbush_for_redwood_furniture.py
p_vs_np/database_problems/linear_bounded_automation_acceptance.py
p_vs_np/database_problems/linear_programming.py
p_vs_np/database_problems/matrix_cover.py
p_vs_np/database_problems/matrix_domination.py
p_vs_np/database_problems/maximum_2_satisfiability.py
p_vs_np/database_problems/maximum_likelihood_ranking.py
p_vs_np/database_problems/microcode_bit_optimization.py
p_vs_np/database_problems/minimum_axiom_set.py
p_vs_np/database_problems/minimum_cardinality_key.py
p_vs_np/database_problems/minimum_disjunctive_normal_form.py
p_vs_np/database_problems/minimum_inferred_finite_state_automation.py
p_vs_np/database_problems/minimum_inferred_regular_expression.py
p_vs_np/database_problems/minimum_length_triangulation.py
p_vs_np/database_problems/minimum_weight_and_or_graph_solution.py
p_vs_np/database_problems/minimum_weight_solution_to_linear_equations.py
p_vs_np/database_problems/modal_logic_provability.py
p_vs_np/database_problems/modal_logic_s5_satisfiability.py
p_vs_np/database_problems/multiprocessor_processing.py
p_vs_np/database_problems/no_wait_flow_shop_scheduling.py
p_vs_np/database_problems/non_containment_for_free_b_schemes.py
p_vs_np/database_problems/non_divisibility_of_a_product_polynomial.py
p_vs_np/database_problems/non_erasing_stack_automation_acceptance.py
p_vs_np/database_problems/non_freedom_for_loop_free_program_schemes.py
p_vs_np/database_problems/non_liveness_of_free_choice_petri_nets.py
p_vs_np/database_problems/non_lr_k_context_free_grammar.py
p_vs_np/database_problems/non_trivial_greatest_common_divisor.py
p_vs_np/database_problems/not_all_equal_3sat.py
p_vs_np/database_problems/number_of_roots_for_a_product_polynomial.py
p_vs_np/database_problems/nxn_checkers.py
p_vs_np/database_problems/nxn_go.py
p_vs_np/database_problems/one_in_three_3sat.py
p_vs_np/database_problems/open_hemisphere.py
p_vs_np/database_problems/open_shop_scheduling.py
p_vs_np/database_problems/partial_order_dimension.py
p_vs_np/database_problems/partially_ordered_knapsack.py
p_vs_np/database_problems/periodic_solution_recurrence_relation.py
p_vs_np/database_problems/permanent_evaluation.py
p_vs_np/database_problems/permutation_generation.py
p_vs_np/database_problems/precedence_constrained_3_processor_scheduling.py
p_vs_np/database_problems/precedence_constrained_scheduling.py
p_vs_np/database_problems/predicate_logic_without_negation.py
p_vs_np/database_problems/preemptive_scheduling.py
p_vs_np/database_problems/prime_attribution_name.py
p_vs_np/database_problems/production_planning.py
p_vs_np/database_problems/programs_with_formally_recursive_procedures.py
p_vs_np/database_problems/quadratic_congruences.py
p_vs_np/database_problems/quadratic_diophantine_equations.py
p_vs_np/database_problems/quadratic_programming.py
p_vs_np/database_problems/quantified_boolean_formulas_(qbf).py
p_vs_np/database_problems/quasi_real_time_language_membership.py
p_vs_np/database_problems/quasi_realtime_automation_acceptance.py
p_vs_np/database_problems/randomization_test_for_matched_pairs.py
p_vs_np/database_problems/reachability_for_1_conservative_petri_nets.py
p_vs_np/database_problems/reduction_of_incompletely_specified_automata.py
p_vs_np/database_problems/register_sufficiency.py
p_vs_np/database_problems/register_sufficiency_for_loops.py
p_vs_np/database_problems/regular_expression_inequivalence.py
p_vs_np/database_problems/regular_grammar_inequivalence.py
p_vs_np/database_problems/resource_constrained_scheduling.py
p_vs_np/database_problems/reynolds_covering_for_context_free_grammars.py
p_vs_np/database_problems/root_of_modulus_1.py
p_vs_np/database_problems/safety_of_database_transaction_systems_(*).py
p_vs_np/database_problems/safety_of_file_protection_systems.py
p_vs_np/database_problems/satisfiability_of_boolean_expressions.py
p_vs_np/database_problems/scheduling_to_minimize_weighted_completion_time.py
p_vs_np/database_problems/scheduling_with_individual_deadlines.py
p_vs_np/database_problems/second_order_instantiation.py
p_vs_np/database_problems/sequencing_to_miniminze_tardy_tasks.py
p_vs_np/database_problems/sequencing_to_minimize_maximum_cumulative_cost.py
p_vs_np/database_problems/sequencing_to_minimize_tardy_task_weight.py
p_vs_np/database_problems/sequencing_to_minimize_weighted_completion_time.py
p_vs_np/database_problems/sequencing_to_minimize_weighted_tardiness.py
p_vs_np/database_problems/sequencing_with_deadlines_and_set_up_times.py
p_vs_np/database_problems/sequencing_with_release_times_and_deadlines.py
p_vs_np/database_problems/sequential_truth_assignment.py
p_vs_np/database_problems/serializability_of_database_histories.py
p_vs_np/database_problems/shapley_shubik_voting_power.py
p_vs_np/database_problems/sift.py
p_vs_np/database_problems/simply_deviated_disjunction.py
p_vs_np/database_problems/simultaneous_divisibility_of_linear_polynomials.py
p_vs_np/database_problems/simultaneous_incongruences.py
p_vs_np/database_problems/spanning_tree_parity_problem.py
p_vs_np/database_problems/staff_scheduling.py
p_vs_np/database_problems/strong_in_equivalence_of_ianov_schemes.py
p_vs_np/database_problems/strong_inequivalence_for_monadic_recursion.py
p_vs_np/database_problems/structural_inequivalence_for_linear_grammars.py
p_vs_np/database_problems/subgraph_homeomorphism_(for_a_fixed_graph_h).py
p_vs_np/database_problems/tableau_equivalence.py
p_vs_np/database_problems/timetable_design.py
p_vs_np/database_problems/total_unimodularity.py
p_vs_np/database_problems/travelling_salesman_polytope_non_adjacency.py
p_vs_np/database_problems/tree_transducer_language_membership.py
p_vs_np/database_problems/truth_functionally_complete_connectives.py
p_vs_np/database_problems/two_processor_flow_shop_with_bounded_buffer.py
p_vs_np/database_problems/two_way_finite_state_automation_non_emptiness.py
p_vs_np/database_problems/unification_for_finitely_presented_algebras.py
p_vs_np/database_problems/unification_with_commutative_operators.py
p_vs_np/database_problems/variable_partition_truth_assignment.py
p_vs_np/flow_problems/2-dimensional_consecutive_sets.py
p_vs_np/flow_problems/3-Partition.py
p_vs_np/flow_problems/3-dimensional_matching_(3dm).py
p_vs_np/flow_problems/3-matroid_intersection.py
p_vs_np/flow_problems/Partition.py
p_vs_np/flow_problems/__init__.py
p_vs_np/flow_problems/bin_packing.py
p_vs_np/flow_problems/bounded_post_correspondence_problem.py
p_vs_np/flow_problems/capacity_assignment.py
p_vs_np/flow_problems/comparative_containment.py
p_vs_np/flow_problems/consecutive_block_minimization.py
p_vs_np/flow_problems/consecutive_ones_matrix_augmentation.py
p_vs_np/flow_problems/consecutive_ones_matrix_partition.py
p_vs_np/flow_problems/consecutive_ones_submatrix.py
p_vs_np/flow_problems/consecutive_sets.py
p_vs_np/flow_problems/constrained_triangulation.py
p_vs_np/flow_problems/directed_two-commodity_integral_flow.py
p_vs_np/flow_problems/disjoint_connecting_paths.py
p_vs_np/flow_problems/dynamic_storage_allocation.py
p_vs_np/flow_problems/edge_embedding_on_a_grid.py
p_vs_np/flow_problems/exact_cover_by_3-sets_(x3c).py
p_vs_np/flow_problems/expected_component_sum.py
p_vs_np/flow_problems/expected_retrieval_costs.py
p_vs_np/flow_problems/external_macro_data_compression.py
p_vs_np/flow_problems/geometric_connected_dominating_set.py
p_vs_np/flow_problems/grouping_by_swapping.py
p_vs_np/flow_problems/hitting_string.py
p_vs_np/flow_problems/integral_flow_with_bundles.py
p_vs_np/flow_problems/integral_flow_with_homologous_arcs.py
p_vs_np/flow_problems/integral_flow_with_multipliers.py
p_vs_np/flow_problems/internal_macro_data_compression.py
p_vs_np/flow_problems/intersection_graph_for_segments_on_a_grid.py
p_vs_np/flow_problems/intersection_pattern.py
p_vs_np/flow_problems/kth_largest_m-tuple.py
p_vs_np/flow_problems/kth_largest_subset.py
p_vs_np/flow_problems/longest_common_subsequence.py
p_vs_np/flow_problems/maximum_fixed-length_disjointed_paths.py
p_vs_np/flow_problems/maximum_length-bounded_disjoint_paths.py
p_vs_np/flow_problems/min-max_multicenter.py
p_vs_np/flow_problems/min-sum_multicenter.py
p_vs_np/flow_problems/minimizing_dummy_activities_in_pert_networks.py
p_vs_np/flow_problems/minimum_broadcast_time.py
p_vs_np/flow_problems/minimum_cover.py
p_vs_np/flow_problems/minimum_edge-cost_flow.py
p_vs_np/flow_problems/minimum_sum_of_squares.py
p_vs_np/flow_problems/minimum_test_set.py
p_vs_np/flow_problems/multiple_copy_file_allocation.py
p_vs_np/flow_problems/numerical_3-dimensional_matching.py
p_vs_np/flow_problems/numerical_matching_with_target_sums.py
p_vs_np/flow_problems/path_constrained_network_flow.py
p_vs_np/flow_problems/pruned_trie_space_minimization.py
p_vs_np/flow_problems/quadratic_assignment_problem.py
p_vs_np/flow_problems/rectilinear_picture_compression.py
p_vs_np/flow_problems/regular_expression_substitution.py
p_vs_np/flow_problems/rooted_tree_storage_assignment.py
p_vs_np/flow_problems/set_basis.py
p_vs_np/flow_problems/set_packing.py
p_vs_np/flow_problems/set_splitting.py
p_vs_np/flow_problems/shortest_common_supersequence.py
p_vs_np/flow_problems/shortest_common_superstring.py
p_vs_np/flow_problems/sparse_matrix_compression.py
p_vs_np/flow_problems/string_-to-string_correction.py
p_vs_np/flow_problems/subset_product.py
p_vs_np/flow_problems/undirected_flow_with__lower_bounds.py
p_vs_np/flow_problems/undirected_two-commodity_integral_flow.py
p_vs_np/graph_theory/Bandwidth.py
p_vs_np/graph_theory/Clique.py
p_vs_np/graph_theory/Edge-Subgraph.py
p_vs_np/graph_theory/K-Closure.py
p_vs_np/graph_theory/Kernel.py
p_vs_np/graph_theory/__init__.py
p_vs_np/graph_theory/achromatic_number.py
p_vs_np/graph_theory/balanced_complete_bipartite_subgraph.py
p_vs_np/graph_theory/bipartite_subgraph.py
p_vs_np/graph_theory/covering_by_cliques.py
p_vs_np/graph_theory/covering_by_complete_bipartite_subgraphs.py
p_vs_np/graph_theory/cubic_subgraph.py
p_vs_np/graph_theory/degree-bounded_connected_subgraph.py
p_vs_np/graph_theory/digraph_d-morphism.py
p_vs_np/graph_theory/directed_bandwidth.py
p_vs_np/graph_theory/directed_elimination_ordering.py
p_vs_np/graph_theory/directed_hamiltonian_circuit.py
p_vs_np/graph_theory/directed_optimal_linear_arrangement.py
p_vs_np/graph_theory/domatic_number.py
p_vs_np/graph_theory/dominating_set.py
p_vs_np/graph_theory/elimination_degree_sequence.py
p_vs_np/graph_theory/feedback_arc_set.py
p_vs_np/graph_theory/feedback_vertex_set.py
p_vs_np/graph_theory/graph_contractibility.py
p_vs_np/graph_theory/graph_grundy_numbering.py
p_vs_np/graph_theory/graph_homomorphism.py
p_vs_np/graph_theory/graph_k-colourability_(chromatic_number).py
p_vs_np/graph_theory/hamiltonian_circuit.py
p_vs_np/graph_theory/hamiltonian_completion.py
p_vs_np/graph_theory/hamiltonian_path.py
p_vs_np/graph_theory/independent_set.py
p_vs_np/graph_theory/induced_connected_subgraph_with_property_pi.py
p_vs_np/graph_theory/induced_path.py
p_vs_np/graph_theory/induced_subgraph_with_property_pi.py
p_vs_np/graph_theory/intersection_graph_basis.py
p_vs_np/graph_theory/interval_graph_completion.py
p_vs_np/graph_theory/largest_common_subgraph.py
p_vs_np/graph_theory/maximum_subgraph_matching.py
p_vs_np/graph_theory/metric_dimension.py
p_vs_np/graph_theory/minimum_cut_linear_arrangement.py
p_vs_np/graph_theory/minimum_equivalent_digraph.py
p_vs_np/graph_theory/minimum_k-connected_subgraph.py
p_vs_np/graph_theory/minimum_maximal_matching.py
p_vs_np/graph_theory/monochromatic_triangle.py
p_vs_np/graph_theory/multiple_choice_matching.py
p_vs_np/graph_theory/nesetril-rodl_dimension.py
p_vs_np/graph_theory/optimal_linear_arrangement.py
p_vs_np/graph_theory/oriented_diameter.py
p_vs_np/graph_theory/partial_feedback_edge_set.py
p_vs_np/graph_theory/partition_into_cliques.py
p_vs_np/graph_theory/partition_into_forests.py
p_vs_np/graph_theory/partition_into_hamiltonian_subgraphs.py
p_vs_np/graph_theory/partition_into_isomorphic_subgraphs.py
p_vs_np/graph_theory/partition_into_perfect_matchings.py
p_vs_np/graph_theory/partition_into_triangles.py
p_vs_np/graph_theory/path_distinguishers.py
p_vs_np/graph_theory/path_graph_completion.py
p_vs_np/graph_theory/path_with_forbidden_pairs.py
p_vs_np/graph_theory/planar_subgraph.py
p_vs_np/graph_theory/rooted_tree_arrangement.py
p_vs_np/graph_theory/subgraph_isomorphism.py
p_vs_np/graph_theory/threshold_number.py
p_vs_np/graph_theory/transitive_subgraph.py
p_vs_np/graph_theory/unconnected_subgraph.py
p_vs_np/graph_theory/vertex_cover.py
p_vs_np/graph_theory/weighted_diameter.py
p_vs_np/network_design/Stacker-Crane.py
p_vs_np/network_design/__init__.py
p_vs_np/network_design/acyclic_partition.py
p_vs_np/network_design/biconnectivity_augmentation.py
p_vs_np/network_design/bottleneck_travelling_salesman.py
p_vs_np/network_design/bounded_component_spanning_tree.py
p_vs_np/network_design/bounded_diameter_spanning_tree.py
p_vs_np/network_design/capacitated_spanning_tree.py
p_vs_np/network_design/chinese_postman_for_mixed_graphs.py
p_vs_np/network_design/degree_constrained_spanning_tree.py
p_vs_np/network_design/geometric_capacitated_spanning_tree.py
p_vs_np/network_design/geometric_steiner_tree.py
p_vs_np/network_design/graph_partition.py
p_vs_np/network_design/isomorphic_spanning_tree.py
p_vs_np/network_design/k^th_best_spanning_tree.py
p_vs_np/network_design/kth_shortest_path.py
p_vs_np/network_design/longest_circuit.py
p_vs_np/network_design/longest_path.py
p_vs_np/network_design/max_cut.py
p_vs_np/network_design/maximum_leaf_spanning_tree.py
p_vs_np/network_design/minimum_cut_into_bounded_sets.py
p_vs_np/network_design/multiple_choice_branching.py
p_vs_np/network_design/network_reliability.py
p_vs_np/network_design/network_survivability.py
p_vs_np/network_design/optimum_communication_spanning_tree.py
p_vs_np/network_design/rural_postman.py
p_vs_np/network_design/shortest_total_path_length_spanning_tree.py
p_vs_np/network_design/shortest_weight-constrained_path.py
p_vs_np/network_design/steiner_tree_in_graphs.py
p_vs_np/network_design/strong_connectivity_augmentation.py