Awesome q2a theme
0 votes
26 views

What is the time complexity for checking whether an assignment of truth values to variables $x_{1}\dots x_{n}$ satisfies a given formula $f(x_{1},\dots,x_{n})?$

  1. $O(2^{n})$
  2. $O(g(n))$ , where $g$ is a polynomial
  3. $O(\log (n))$
  4. None of the above 
closed with the note: duplicate
in Digital Logic by (116 points)
closed by | 26 views
0
is A the ans?
0
No the correct answer is $(B).$
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Jul 2020
  1. Shaik Masthan

    39 Points

  2. hiteshpujari

    9 Points

  3. Venkatesh Akhouri

    6 Points

  4. Meghana518

    6 Points

  5. bittujash

    6 Points

  6. Pawan_k

    6 Points

  7. rits78671

    6 Points

  8. srestha

    6 Points

  9. RavGopal

    4 Points

  10. Sumaiyas

    4 Points

7,543 questions
1,783 answers
10,867 comments
90,482 users