Beefy Boxes and Bandwidth Generously Provided by pair Networks
good chemistry is complicated,
and a little bit messy -LW
 
PerlMonks  

Re^6: Comparative satisfiability of regexps.

by Aristotle (Chancellor)
on Jan 21, 2005 at 12:20 UTC ( [id://423943]=note: print w/replies, xml ) Need Help??


in reply to Re^5: Comparative satisfiability of regexps.
in thread Comparative satisfiability of regexps.

That analogy is flawed. That's how public key cryptography is implemented in practice, for practical reasons, to be sure. It's not how the cryptographic algorithms are constructed mathematically, however. And of course there's the quantifiable vs Monte Carlo difference Meowse mentioned.

Makeshifts last the longest.

  • Comment on Re^6: Comparative satisfiability of regexps.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://423943]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others goofing around in the Monastery: (6)
As of 2024-04-18 19:13 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found