Fundraising September 15, 2024 – October 1, 2024
About fundraising
books search
books
Fundraising:
32.6% raised
Log In
Log In
to access more features
personal recommendations
Telegram Bot
download history
send to Email or Kindle
manage booklists
save to favorites
Personal
Book Requests
Explore
Z-Recommend
Booklists
Most Popular
Categories
Contribution
Donate
Uploads
Litera Library
Donate paper books
Add paper books
Search paper books
My LITERA Point
Terms search
Main
Terms search
search
1
Parameterized complexity in the polynomial hierarchy
Springer
de Haan R
ϕ
parameterized
fpt
complexity
variables
formula
assignment
parameter
algorithm
polynomial
reduction
proposition
wsat
satisfies
exists
consider
input
formulas
moreover
function
oracle
reductions
define
construct
computable
hierarchy
weight
propositional
sets
assume
cit
fixed
boolean
algorithms
fptnp
arbitrary
clauses
subset
judgment
hardness
integer
sect
queries
bounded
theorem
tractable
dnf
advice
quantified
kemeny
Year:
2019
Language:
english
File:
PDF, 2.81 MB
Your tags:
0
/
0
english, 2019
2
Parameterized Complexity in the Polynomial Hierarchy: Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy
Springer Berlin Heidelberg
Ronald de Haan
ϕ
parameterized
fpt
complexity
variables
formula
assignment
parameter
algorithm
polynomial
reduction
proposition
wsat
satisfies
exists
consider
input
formulas
moreover
function
oracle
reductions
define
construct
computable
hierarchy
weight
propositional
sets
assume
cit
fixed
boolean
algorithms
fptnp
arbitrary
clauses
subset
judgment
hardness
integer
sect
queries
bounded
theorem
tractable
dnf
advice
quantified
kemeny
Year:
2019
Language:
english
File:
PDF, 5.44 MB
Your tags:
0
/
0
english, 2019
1
Follow
this link
or find "@BotFather" bot on Telegram
2
Send /newbot command
3
Specify a name for your chatbot
4
Choose a username for the bot
5
Copy an entire last message from BotFather and paste it here
×
×