Is the Proof Length a Good Indicator of Hardness for Reason-able Embeddings?
Jedrzej PotoniecPublished in: NeSy (2023)
Keyphrases
- low dimensional
- theorem proving
- manifold learning
- worst case
- phase transition
- np complete
- dimensionality reduction
- fixed length
- computational complexity
- information theoretic
- vector space
- minimal length
- databases
- theorem prover
- distance measure
- objective function
- information systems
- genetic algorithm
- machine learning