Descriptive Complexity for Counting Problems, M.Sc. Thesis Sharif University of Technology ; Ebrahimi Boroojeni, Javad (Supervisor)
Abstract
Descriptive complexity refers to the difficulty of expressing a problem in a formal language, allowing for a complete and precise description of the problem, including output specifications for function problems. Despite the success of the descriptive approach in computational complexity, this approach has been predominantly used for decision problems. In contrast to decision problems, a counting problem can be considered as a function with the range of natural numbers. This thesis focuses on the examination of counting problems from a descriptive perspective, exploring the connection between their descriptive and computational versions. Toward this goal, weighted logic is utilized to...
Cataloging briefDescriptive Complexity for Counting Problems, M.Sc. Thesis Sharif University of Technology ; Ebrahimi Boroojeni, Javad (Supervisor)
Abstract
Descriptive complexity refers to the difficulty of expressing a problem in a formal language, allowing for a complete and precise description of the problem, including output specifications for function problems. Despite the success of the descriptive approach in computational complexity, this approach has been predominantly used for decision problems. In contrast to decision problems, a counting problem can be considered as a function with the range of natural numbers. This thesis focuses on the examination of counting problems from a descriptive perspective, exploring the connection between their descriptive and computational versions. Toward this goal, weighted logic is utilized to...
Find in contentBookmark |
|