Register

Recent questions tagged complexity

0 0 votes
0 0 answers
192
192 views
UGC NET CSE | January 2025 | Part 2 | Question: 62
Choose the correct statement(s)A problem which is $\text{NP}$-Complete will have the property that it can be solved in polynomial time iff all other $\text{NP}$-complete ...
User Avatar
1 1 vote
1 1 answer
545
545 views
TIFR CSE 2024 | Part B | Question: 12
In the $n$-queens completion problem, the input is an $n \times n$ chess board with queens on some squares, and the goal is to determine if there is a way to place more q...
User Avatar
0 0 votes
2 2 answers
555
555 views
UGCNET CSE December 2022: 27
Given the $\text{FFT}$ we can have time procedure for multiplying two polynomials $\mathrm{A}(\mathrm{x})$ and $\mathrm{B}(\mathrm{x})$ of degree bound $\mathrm{n}$ where...
User Avatar
0 0 votes
1 answers 1 answer
601
601 views
TANCET 2011 TURING MACHINES
Time taken by one tape TM to simulate n moves of k-tape TM is1) O(n)2) O(n^k)3) O(n^2)4) None of the above
User Avatar
0 0 votes
1 1 answer
422
422 views
TANCET 2016 P Vs NP
User Avatar
To see more, click for the full list of questions or popular tags.