Kevin Karhan Jul 13

#Tempolimit in #Deutschland wäre so wie das #2ndAmendment in den #USA streichen:

Eher kriegen wir #Bauen dazu auf #Agrardiesel - #Subventionen zu verzichten und aufzuhören soviel #Schweinegülle auf die Felder zu verklappen dass das #Grundwasser in Teilen Deutschlands nach Pisse schmeckt und stinkt, weil #Nitratbelastung...

#DEpol #USpol

Halt Stopp Das bleibt alles so wie's hier ist

YouTube
Oh! MediaJul 1
Insiden Di Putra Heights Diklasifikasi NFA, Polis Sedia Siasat Semula Jika Ada Bukti Baru - https://ohmedia.my/trending/insiden-di-putra-heights-diklasifikasi-nfa-polis-sedia-siasat-semula-jika-ada-bukti-baru/
#Kebakaran #letupan #nfa #Putraheights
Insiden Di Putra Heights Diklasifikasi NFA, Polis Sedia Siasat Semula Jika Ada Bukti Baru | Trending - Oh! Media

Letupan gas Putra Heights diklasifikasikan NFA, tapi polis sedia buka semula siasatan jika muncul bukti baharu. - Baca artikel penuh di Oh! Media untuk info lanjut.

Insiden Di Putra Heights Diklasifikasi NFA, Polis Sedia Siasat Semula Jika Ada Bukti Baru | Oh! Media
arXiv cs.DS botJul 1

Towards practical FPRAS for #NFA: Exploiting the Power of Dependence

Kuldeep S. Meel, Alexis de Colnet
https://arxiv.org/abs/2506.23561 https://arxiv.org/pdf/2506.23561 https://arxiv.org/html/2506.23561

arXiv:2506.23561v1 Announce Type: new
Abstract: #NFA refers to the problem of counting the words of length $n$ accepted by a non-deterministic finite automaton. #NFA is #P-hard, and although fully-polynomial-time randomized approximation schemes (FPRAS) exist, they are all impractical. The first FPRAS for #NFA had a running time of $\tilde{O}(n^{17}m^{17}\varepsilon^{-14}\log(\delta^{-1}))$, where $m$ is the number of states in the automaton, $\delta \in (0,1]$ is the confidence parameter, and $\varepsilon > 0$ is the tolerance parameter (typically smaller than $1$). The current best FPRAS achieved a significant improvement in the time complexity relative to the first FPRAS and obtained FPRAS with time complexity $\tilde{O}((n^{10}m^2 + n^6m^3)\varepsilon^{-4}\log^2(\delta^{-1}))$. The complexity of the improved FPRAS is still too intimidating to attempt any practical implementation.
In this paper, we pursue the quest for practical FPRAS for #NFA by presenting a new algorithm with a time complexity of $O(n^2m^3\log(nm)\varepsilon^{-2}\log(\delta^{-1}))$. Observe that evaluating whether a word of length $n$ is accepted by an NFA has a time complexity of $O(nm^2)$. Therefore, our proposed FPRAS achieves sub-quadratic complexity with respect to membership checks.

toXiv_bot_toot

Towards practical FPRAS for #NFA: Exploiting the Power of Dependence

#NFA refers to the problem of counting the words of length $n$ accepted by a non-deterministic finite automaton. #NFA is #P-hard, and although fully-polynomial-time randomized approximation schemes (FPRAS) exist, they are all impractical. The first FPRAS for #NFA had a running time of $\tilde{O}(n^{17}m^{17}\varepsilon^{-14}\log(δ^{-1}))$, where $m$ is the number of states in the automaton, $δ\in (0,1]$ is the confidence parameter, and $\varepsilon > 0$ is the tolerance parameter (typically smaller than $1$). The current best FPRAS achieved a significant improvement in the time complexity relative to the first FPRAS and obtained FPRAS with time complexity $\tilde{O}((n^{10}m^2 + n^6m^3)\varepsilon^{-4}\log^2(δ^{-1}))$. The complexity of the improved FPRAS is still too intimidating to attempt any practical implementation. In this paper, we pursue the quest for practical FPRAS for #NFA by presenting a new algorithm with a time complexity of $O(n^2m^3\log(nm)\varepsilon^{-2}\log(δ^{-1}))$. Observe that evaluating whether a word of length $n$ is accepted by an NFA has a time complexity of $O(nm^2)$. Therefore, our proposed FPRAS achieves sub-quadratic complexity with respect to membership checks.

arXiv.org
TCS blog aggregatorJul 1

Towards practical FPRAS for #NFA: Exploiting the Power of Dependence http://arxiv.org/abs/2506.23561v1

Authors: Kuldeep S. Meel, Alexis de Colnet#NFA refers to the problem of counting the words of length $n$ accepted by a
non-deterministic finite automaton. #NFA is #P-hard, and although
fully-polynomial-time randomized approximation schemes (FPRAS) exist, they are
all impractical. The first FPRAS for #NFA had a running time of
$tilde{O}(n^{17}m^{17}varepsilon^{-14}log(delta^{-1}))$, where

Towards practical FPRAS for #NFA: Exploiting the Power of Dependence

#NFA refers to the problem of counting the words of length $n$ accepted by a non-deterministic finite automaton. #NFA is #P-hard, and although fully-polynomial-time randomized approximation schemes (FPRAS) exist, they are all impractical. The first FPRAS for #NFA had a running time of $\tilde{O}(n^{17}m^{17}\varepsilon^{-14}\log(δ^{-1}))$, where $m$ is the number of states in the automaton, $δ\in (0,1]$ is the confidence parameter, and $\varepsilon > 0$ is the tolerance parameter (typically smaller than $1$). The current best FPRAS achieved a significant improvement in the time complexity relative to the first FPRAS and obtained FPRAS with time complexity $\tilde{O}((n^{10}m^2 + n^6m^3)\varepsilon^{-4}\log^2(δ^{-1}))$. The complexity of the improved FPRAS is still too intimidating to attempt any practical implementation. In this paper, we pursue the quest for practical FPRAS for #NFA by presenting a new algorithm with a time complexity of $O(n^2m^3\log(nm)\varepsilon^{-2}\log(δ^{-1}))$. Observe that evaluating whether a word of length $n$ is accepted by an NFA has a time complexity of $O(nm^2)$. Therefore, our proposed FPRAS achieves sub-quadratic complexity with respect to membership checks.

arXiv.org
ButterWordJun 23
La reforma de NFA permite que el gobierno compre Palay a precio acoplado - Romualdez #compre #gobierno #JUSTO #NFA #Palay #permite #precio #reforma #Romualdez #ButterWord #Spanish_News Comenta tu opinión 👇
https://butterword.com/la-reforma-de-nfa-permite-que-el-gobierno-compre-palay-a-precio-acoplado-romualdez/?feed_id=28007&_unique_id=6859805a0cc62
La reforma de NFA permite que el gobierno compre Palay a precio acoplado - Romualdez – ButterWord

Proposals to reform NFA will allow the government to buy palay or rice grains at fair prices so that farmers will not be shortchanged.

ButterWord
Show threadGemma ⭐️🔰🇺🇸 🇵🇭 🎐Jun 18
The likely outcome is that the Court will issue a new opinion upholding the revised DoJ position, which is that suppressors are indeed #RTKBA #AmendmentII protected arms, based on prior #SCOTUS precedent (cf: Heller, McDonald, Bruen, Rahimi), but it is highly likely that the Court will opine that suppressors are still subject to the additional background checks and fees of #NFA1934 (at least, until Congress removes them from the #NFA, which is probable, currently in process). #USpol #ConLaw
Blaze TrendsMay 29

NFA Revamps Tournaments, Opens Door for New Stars in Free Fire Emulator Scene

#emulator #esports #FF #gaming #NFA
https://blazetrends.com/nfa-revamps-tournaments-opens-door-for-new-stars-in-free-fire-emulator-scene/?fsp_sid=41120

NFA Revamps Tournaments, Opens Door for New Stars in Free Fire Emulator Scene

Free Fire's biggest emulator tournament circuit, the NFA, just got a whole lot more exciting. Sponsored by Pichau, the NFA is shaking things up with a new

Blaze Trends
Blaze TrendsMay 23

NFA League: Top 7 Most Victorious Teams in Free Fire History Revealed

#championshipteams #football #NFA #SportsHistory #winningteams
https://blazetrends.com/nfa-league-top-7-most-victorious-teams-in-free-fire-history-revealed/?fsp_sid=37455

NFA League: Top 7 Most Victorious Teams in Free Fire History Revealed

With their latest win, Fluxo has solidified their position as the team to beat. They've won six titles in a row, including the Liga NFA, Copa NFA, NFA Favela

Blaze Trends
Blaze TrendsMay 20

Top Free Fire Players with Most NFA Titles Revealed

#athletes #Championships #football #NFA #sports
https://blazetrends.com/top-free-fire-players-with-most-nfa-titles-revealed/?fsp_sid=35333

Top Free Fire Players with Most NFA Titles Revealed

Other top players include:

Blaze Trends
Blaze TrendsMay 19

Fluxo Coach Reveals Secret to NFA League Championship Win, Praises Team's Mental Preparation

#esports #Fluxo #gaming #NFA #title
https://blazetrends.com/fluxo-coach-reveals-secret-to-nfa-league-championship-win-praises-teams-mental-preparation/?fsp_sid=34411

Fluxo Coach Reveals Secret to NFA League Championship Win, Praises Team's Mental Preparation

The Fluxo team has claimed the top spot in the first stage of the NFA League, a tournament backed by Pichau. Behind every big win is a sharp mind. We sat down

Blaze Trends